CT64095

Smith's Ledger of shelves

MediumL6 · Pointer PhantomAcceptance: 0.0%XP: 100

The harbor bell rings at the fjord village of Deepwater; Smith weighs the day's shelves manifests and starts the calculations. Task: For each position i, print how many elements to its right are strictly smaller than a[i]. Input format: First line: n. Second line: n integers. Output format: Print n counts space-separated. Constraints: 1 <= n <= 1837; -1000000 <= a[i],x <= 1000000.

Example 1:

Input: 1621 -700426 543685 740413 23712 824011 -954358 -830426 -992401 193659 599109 623559 -190169 217234 169388 542033 134965 844292 -340522 294290 -657139 532773 -209740 533594 667046 708311 -39361 552221 779519 -664633 -702867 -519411 276430 42357 -648753 598381 -829206 288890 -219961 987175 452319 -431216 712935 -33905 771708 744770 -120 531314 -675324 -550583 268764 788747 294511 79199 267447 678034 813347 189053 -590872 -69908 813757 120500 147951 966900 -765105 160213 863427 502036 659838 -663044 781024 905907 -899852 268004 -70502 445758 589712 208088 -987117 119087 -61152 -847513 664728 734907 -535767 -192835 -153212 864686 -153806 797642 -376204 351337 -114765 -274468 442034 622155 666932 120484 867025 -630659 -419713 -857639 -821951 245143 59911 -475568 -208814 -301408 406297 564520 7…
Output: 229 1232 1391 816 1472 31 134 2 939 1277 1299 637 958 926 1221 898 1477 495 1016 262 1211 611 1211 1317 1344 751 1221 1408 257 225 366 997 821 267 1256 135 1002 597 1573 1133 422 1334 747 1386 1359 774 1194 243 336 981 1391 1000 837 977 1297 1413 917 304 719 1410 865 887 1532 187 895 1448 1163 1277 253 1373 1481 76 968 715 1107 1218 923 5 857 717 115 1268 1320 343 613 636 1430 635 1367 453 1025 670 541 1089 1235 1262 849 1427 271 423 106 136 933 802 379 589 515 1050 1176 1305 1385 238 108 904 721 57 176 638 48 617 781 1248 179 526 440 927 1118 421 951 49 31 638 662 1265 409 353 864 10 889 1189 839 1329 1152 793 66 1148 853 402 514 1308 463 96 271 264 1340 1330 828 342 403 538 274 1018 445 285 1259 131 1343 915 639 307 1204 1176 663 417 130 491 1131 669 1156 310 1408 233 1391 709 1193 919 4…

Example 2:

Input: 435 655500 851937 -548885 -889502 577239 451016 -154542 519564 621762 -993566 653683 -995031 -985202 -987506 678934 166617 949409 -784927 77888 687676 160212 -756352 -502981 106587 879250 542766 -993373 -126300 -319851 -685729 343426 -829842 -452506 -73634 -696513 -752690 837648 -646470 -48292 -736265 -625292 171230 968105 44577 -388093 -597789 158707 288794 -81867 872081 173255 -75956 809164 -433873 -657772 -399376 -156963 -786133 -807209 771055 275015 751221 -144453 645457 479979 -275296 -48442 -303272 768209 672334 -63535 458441 586969 -557797 -19455 187338 839137 -554925 -323680 696502 410671 -689202 -822308 333985 202464 -991746 -469788 -521045 447208 133171 -673022 804163 715882 -447427 56664 359414 154208 670604 -980601 104020 22304 946433 409140 -273260 808806 -937760 903686 113255…
Output: 363 409 100 28 347 327 186 339 349 4 354 2 8 7 358 258 412 51 240 355 255 54 101 242 390 331 3 181 136 65 288 37 105 190 59 52 374 73 197 54 73 239 388 217 112 74 235 262 180 365 236 181 354 102 70 108 162 48 42 339 251 332 161 311 291 133 182 123 330 312 176 281 296 79 186 224 338 79 113 305 265 57 39 249 223 4 87 80 265 208 59 314 300 88 193 246 207 288 8 199 183 328 248 123 304 19 315 196 276 249 170 153 248 184 18 60 59 235 141 35 224 227 53 193 268 248 278 75 39 280 92 44 215 220 17 123 141 277 198 132 153 70 114 67 92 250 239 217 261 185 29 212 56 69 79 186 214 146 117 128 90 35 165 263 93 232 224 72 43 28 181 116 134 110 229 172 44 201 146 123 78 14 251 42 92 39 97 202 232 51 137 4 46 7 81 113 42 18 157 55 29 184 16 71 122 146 108 59 63 0 151 163 57 107 177 20 157 66 3 31 59 15 39 1…

Example 3:

Input: 559 196085 41560 -843677 -872912 712416 -135998 443311 656930 -750634 -863177 325569 -328641 545417 569709 -787498 -345350 335807 534914 944150 819538 250664 -841804 -856222 709385 452397 -575838 387543 830612 236211 401246 -933621 310827 -376062 -596175 227261 870213 333906 -392499 726071 112203 900117 -919595 -320270 149777 -830910 -718521 -258809 343670 -934536 860728 96186 -566598 -986439 -16024 -60925 -682152 -906552 429481 4627 434702 -58726 -472501 994867 67107 -164241 438665 -702298 312308 -954789 -460324 188097 -551017 -131897 944262 36385 873733 835410 427774 119161 -199861 -9448 440535 -496488 208949 -132913 -973001 -874952 -798470 -168442 -422353 -378858 -161478 952198 203212 196370 939138 481507 -415099 -881991 405469 -844876 653249 385766 -784580 -462549 -963443 -390768 81906…
Output: 314 273 50 43 462 229 390 446 69 43 348 176 411 417 58 171 349 405 521 477 323 48 45 444 381 105 357 474 319 362 23 331 157 100 311 481 338 152 435 272 483 28 167 281 47 67 177 331 22 467 257 101 4 236 222 74 31 347 243 347 221 123 496 244 197 344 65 307 14 124 273 101 202 468 236 445 433 333 249 186 228 332 117 275 199 6 35 45 186 126 136 185 453 264 260 446 325 126 33 310 37 365 301 44 114 10 128 399 445 448 269 386 6 335 139 81 38 90 205 102 88 72 118 92 416 330 18 367 177 67 138 47 24 362 271 332 149 263 409 6 272 16 267 6 239 78 303 294 121 122 22 49 234 52 254 373 300 98 225 399 199 295 112 157 172 326 214 111 178 106 232 145 207 88 6 102 226 217 87 221 260 62 141 175 50 192 333 81 19 185 311 219 345 307 132 147 232 294 339 44 206 90 204 265 143 320 276 154 305 166 7 83 171 137 261 3…

Constraints:

1 <= n <= 1837; -1000000 <= a[i],x <= 1000000.

Loading...
Test Cases:No test cases
No test cases available.
Smith's Ledger of shelves - MEDIUM Coding Problem | CodeTikki