CT35125

The Streak Back at Tuskmore

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

The reckoner Cobbler has been asked to compute the guild dues owed. On the desk lies a long table of signals readings. Task: For each day i, print how many consecutive days up to and including i have a price <= a[i]. Input format: First line: n. Second line: n integers. Output format: Print n spans space-separated. Constraints: 1 <= n <= 4000; 0 <= a[i] <= 10^9.

Example 1:

Input: 1658 405217135 751101945 129821462 129113568 252358138 364461364 329861450 963384569 39679643 651581618 23299595 226143317 984660502 999242222 188500016 182843749 598303159 74452696 138934681 349858245 673883258 31664512 676956124 282727112 409988864 197452372 863267527 309807389 484189463 611382345 223171532 408497637 92844951 335559141 478153586 207967565 128710442 500084997 350692015 549675512 249643862 737985035 45999623 887902522 642830968 733282353 870837718 653034000 519608514 855547042 202561519 899519772 514445769 525921418 923960659 906801467 353377516 277879607 331775524 904229050 33758613 300346296 182418271 793395124 203229902 504991764 759219098 829870747 579832805 338724598 819525653 312430275 771419647 597539535 510461498 109124621 338295708 878249218 791900938 260429279 90…
Output: 1 2 1 1 3 4 1 8 1 2 1 2 13 14 1 1 3 1 2 3 7 1 9 1 2 1 13 1 2 3 1 2 1 2 5 1 1 8 1 10 1 15 1 30 1 2 3 1 1 3 1 38 1 2 41 1 1 1 2 4 1 2 1 4 1 2 3 8 1 1 3 1 2 1 1 1 2 18 1 1 21 1 1 70 1 1 3 1 5 1 1 2 4 5 81 1 1 2 3 1 1 7 1 2 1 2 1 2 14 1 16 1 1 1 2 21 1 1 2 3 1 5 1 2 1 31 1 2 3 1 1 6 1 1 3 1 11 1 13 14 1 2 1 2 131 1 1 2 1 4 1 2 1 4 1 2 1 1 3 6 1 8 1 1 1 12 153 1 2 1 2 3 6 1 1 2 1 1 1 3 4 5 10 1 1 13 1 1 2 17 1 2 1 2 1 6 1 1 2 4 1 12 1 14 1 1 40 1 1 3 1 2 3 1 5 1 2 1 4 5 54 1 2 1 1 1 1 5 1 2 1 2 1 11 1 15 1 1 2 3 1 5 1 7 8 10 1 2 3 4 1 2 1 1 2 4 7 8 1 1 15 1 2 3 1 2 6 1 2 1 4 1 1 13 1 15 1 1 2 1 2 46 1 1 2 1 5 1 2 1 9 1 1 3 1 5 6 1 1 2 3 1 21 1 2 1 1 2 1 7 1 1 1 11 94 1 317 1 1 3 4 5 1 1 2 9 1 2 1 13 1 2 3 1 2 3 4 1 2 1 8 1 1 27 1 2 3 4 1 2 3 1 1 2 1 2 1 1 2 6 1 18 1 2 1 1 2 24 1 2 1 1 3 1 2 6 1…

Example 2:

Input: 1990 136447750 199119871 111687204 766423451 317630991 409581901 524057361 579984914 510053225 199552262 178206506 865413254 775834181 830630214 111161345 547261017 18852595 174649586 503884086 891620094 143654016 216526981 357320135 749530856 415958158 189409551 36336648 990525086 20186596 469859257 127842088 539886506 763788333 269479540 385846410 262453878 216761582 580758998 308318738 139069014 606904240 490351722 784137277 745415946 498596133 763972029 318881084 894165500 935917319 44232357 174530437 724722957 115710906 664744622 125808414 317272848 918137940 567015646 630739415 203492627 596637066 693715282 617734604 2121682 6340129 82589273 841058032 515454064 168945199 192782959 406967169 363171583 375493566 479988026 610576928 607266960 609604121 869699134 517037383 166676904 6794…
Output: 1 2 1 4 1 2 3 4 1 1 1 12 1 2 1 2 1 2 3 20 1 2 3 4 1 1 1 28 1 2 1 4 5 1 2 1 1 5 1 1 8 1 15 1 1 3 1 20 21 1 2 3 1 2 1 2 8 1 2 1 2 5 1 1 2 3 10 1 1 2 3 1 2 6 8 1 2 21 1 1 3 4 1 35 1 1 2 4 1 90 1 2 3 4 5 1 1 2 4 5 1 7 13 1 2 1 4 18 1 1 2 1 2 3 6 1 1 3 4 1 13 1 2 1 2 1 2 20 39 1 2 132 1 1 1 2 1 2 1 2 1 4 7 1 11 1 14 1 1 2 1 1 20 1 1 1 3 4 6 1 8 1 1 32 1 2 1 1 5 1 1 3 1 10 1 2 1 1 2 6 1 2 19 1 1 3 1 188 1 2 1 1 2 1 7 1 9 1 1 3 1 2 1 2 1 2 3 8 1 1 23 1 1 2 3 5 1 2 8 1 2 1 2 1 6 1 16 1 2 3 1 1 3 1 1 3 10 1 1 3 4 1 1 2 8 1 1 3 22 1 1 3 1 5 44 1 257 1 2 1 2 5 1 2 1 1 1 4 1 1 1 2 9 1 1 1 3 16 1 1 1 20 1 1 2 29 1 1 3 1 2 1 2 1 4 1 2 9 1 1 2 3 1 2 1 1 1 1 10 1 1 14 1 2 3 1 2 3 30 1 35 1 1 2 1 5 1 1 2 9 1 2 1 2 1 4 1 2 1 1 1 3 1 1 7 1 1 16 1 2 3 1 1 6 1 2 25 101 1 1 3 1 2 3 4 1 6 7 8 1 10 1 2 1 14 1 2 1…

Example 3:

Input: 3892 824619006 938180572 81834883 398057830 19413204 314259775 578978113 464753879 400647039 658192452 859665556 802425844 624065379 712366086 364689215 387037374 821048272 775586524 709817003 518657514 28203648 92080375 720780657 515029100 141148791 977431261 631458989 694400796 738772279 55848909 343140423 284958324 751413156 560849056 304971889 36235427 899337201 375496368 730213175 753928386 948893259 924904127 685652937 43202008 638576512 14923091 170662567 312916256 765083209 636353122 653866727 848252885 719913052 70553598 317586040 127197144 40839573 733310954 864531140 538783633 357476401 725093681 535402554 577172561 199887466 885780790 49334894 671918333 671018069 676083253 586089622 472693439 249729443 367041515 461704061 795831760 21444611 110284546 322508248 691655694 1052286…
Output: 1 2 1 2 1 2 5 1 1 8 9 1 1 2 1 2 6 1 1 1 1 2 5 1 1 26 1 2 3 1 2 1 7 1 1 1 11 1 2 3 15 1 1 1 2 1 2 3 7 1 2 10 1 1 2 1 1 6 17 1 1 3 1 2 1 24 1 2 1 4 1 1 1 2 3 10 1 2 3 4 1 2 1 1 85 1 2 1 1 5 1 1 3 1 10 1 2 1 2 3 1 7 8 1 2 1 2 1 2 1 26 1 2 1 4 1 1 7 1 1 1 4 1 2 1 8 1 2 1 4 1 1 3 1 5 1 7 1 21 1 2 3 4 5 1 1 2 30 1 2 1 4 1 1 155 1 1 1 2 1 1 1 7 1 2 1 4 1 13 1 1 2 18 1 1 21 1 2 3 1 181 1 1 3 4 5 1 1 2 1 1 192 1 2 1 1 3 1 7 1 2 1 2 1 4 1 1 7 1 1 1 1 5 1 1 15 1 2 3 21 1 1 31 1 1 3 35 1 2 3 1 1 3 4 1 9 1 1 2 48 1 2 1 4 1 6 1 1 9 1 1 1 3 1 6 1 1 18 1 1 3 1 5 6 1 2 3 1 1 2 1 5 15 1 2 36 1 2 1 1 5 1 1 3 1 2 3 1 97 1 2 1 4 1 6 1 2 3 4 11 1 2 3 1 2 1 1 3 6 1 22 1 1 3 1 27 1 1 1 2 5 33 1 1 2 1 5 1 1 2 1 1 3 4 8 1 1 3 4 1 1 2 8 1 18 1 2 1 2 5 1 2 1 2 1 29 1 2 1 2 5 1 2 1 9 1 1 2 1 2 1 7 8 1 2 1 2 1 4 1 54 1…

Constraints:

1 <= n <= 4000; 0 <= a[i] <= 10^9.

Loading...
Test Cases:No test cases
No test cases available.
The Streak Back at Tuskmore - MEDIUM Coding Problem | CodeTikki