CT55014

The Streak Back of the Woven registers

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Dino the auditor watches over the indigo vats of Bluehollow's stores of registers. A careful computation stands between order and chaos. 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: 2331 726512670 263265303 594060643 412490866 415897035 486269478 841222608 114951634 536134876 659719674 324778930 814619437 702229012 264605505 689606967 588895452 304538992 300305656 672593250 854508355 28655865 240755319 564202706 695994014 229704368 817847742 348766592 360334295 252858958 185394832 104404709 575850332 878532871 424458489 333456446 645893598 807885542 693294119 203358790 183660115 131540174 167989397 919087389 736234336 752898088 606224180 353457691 109858937 916508498 355968083 997812273 550668920 197591799 316000100 380948153 333092846 132472283 116637401 320249727 319734176 779562810 271985912 662185908 855495940 102619802 906751014 134169350 291137200 489920514 978894358 168749577 823712700 776184023 212745558 227218999 288657489 228109516 570939280 807811047 458203…
Output: 1 1 2 1 2 3 7 1 2 3 1 5 1 1 2 1 1 1 4 20 1 2 3 4 1 6 1 2 1 1 1 6 33 1 1 3 4 1 1 1 1 2 43 1 2 1 1 1 6 1 51 1 1 2 3 1 1 1 3 1 10 1 2 13 1 15 1 2 3 19 1 2 1 1 2 3 1 5 7 1 1 2 13 1 2 3 1 1 19 1 1 2 4 1 6 1 2 28 1 1 2 4 1 2 1 1 2 1 58 1 2 1 2 1 4 1 1 2 1 1 5 1 8 1 10 1 1 1 4 15 1 1 2 1 2 1 2 8 24 1 1 2 3 4 5 31 1 1 3 1 5 1 2 1 44 1 1 1 2 5 1 1 1 1 1 5 7 1 9 1 1 1 1 2 1 1 3 6 8 1 1 3 1 1 3 1 17 1 2 21 22 1 2 1 2 1 1 1 1 4 8 1 43 1 2 1 2 5 1 7 1 212 1 1 1 4 1 1 3 8 1 1 2 1 5 1 2 1 17 18 1 1 3 4 1 1 1 2 3 10 1 2 1 2 5 6 17 1 1 1 4 1 1 7 1 2 3 4 1 2 1 1 5 1 1 2 1 14 1 2 3 1 2 1 21 1 1 2 3 1 1 2 1 2 1 7 33 1 1 2 1 4 6 7 48 1 1 2 1 2 1 4 1 2 3 1 2 12 1 1 1 1 2 5 1 1 8 10 72 1 2 1 2 5 1 1 2 1 1 5 1 2 1 10 1 17 1 2 3 4 1 2 3 4 1 1 2 1 1 3 32 1 1 2 1 4 1 111 1 2 1 1 3 4 1 8 1 2 1 4 1 2 1 1 3 1 2 1 1 1 4…

Example 2:

Input: 662 629262752 814712147 951612146 188990997 219628365 929034177 358232374 782552104 105415117 205838192 332390019 803518188 398428483 753891804 375374700 761298869 221069614 745602858 623220048 519341666 668959184 736994685 943869207 759032087 36925268 405471610 972542031 322890257 462017628 907402196 568969413 833047779 202559916 667831835 781753927 127333386 371378574 210208710 834041997 273797466 305177781 68007416 163553352 705928688 518184698 122213369 779306290 306547016 182784963 498318383 980346328 740250824 530815370 640816719 896652132 366474154 491819300 906328814 967018683 783650218 668643073 755050540 323137822 96132915 472551051 375504058 112922281 514702956 858106266 578439208 41413988 788524381 822492340 212777948 276914968 738071149 246577599 68362658 996123113 654152457 1…
Output: 1 2 3 1 2 3 1 2 1 2 3 6 1 2 1 4 1 2 1 1 3 4 20 1 1 2 27 1 2 3 1 2 1 2 3 1 2 1 9 1 2 1 2 5 1 1 8 1 1 3 51 1 1 2 4 1 2 7 8 1 1 2 1 1 3 1 1 6 10 1 1 3 4 1 2 3 1 1 79 1 1 3 1 5 1 1 1 4 1 6 1 13 1 2 3 1 1 2 7 8 1 2 1 12 1 1 1 3 1 2 32 1 34 1 2 1 1 2 3 4 1 6 8 1 2 3 1 1 6 1 2 3 20 1 2 1 1 1 1 4 5 1 1 9 1 2 1 4 1 1 2 4 18 1 42 1 2 1 1 5 1 49 1 1 3 1 1 6 1 2 3 10 1 12 1 14 1 2 3 1 2 1 2 22 1 1 1 3 27 1 1 2 1 2 1 117 1 1 1 4 5 1 1 1 2 3 1 1 8 1 1 11 17 1 2 3 4 1 2 1 4 5 1 1 2 3 1 15 16 1 1 3 1 1 1 2 3 1 2 8 1 10 14 1 1 17 18 19 1 1 1 3 1 2 1 8 28 45 1 2 1 2 5 1 1 1 2 3 6 1 2 3 4 1 2 1 8 1 1 1 2 1 2 1 2 9 1 11 1 94 212 1 2 1 2 1 4 1 6 7 1 2 10 1 1 15 1 2 1 2 1 2 7 1 1 3 4 1 1 3 4 5 6 1 2 13 1 2 1 4 1 26 1 1 2 4 1 1 1 3 9 1 1 2 3 5 1 1 3 1 1 6 7 1 9 1 1 26 1 1 3 1 5 1 1 8 1 2 1 1 3 1 5 1 1 2 9 1 13 1…

Example 3:

Input: 1171 615388107 148634492 448912231 300517600 552524345 350902592 654591261 206945002 123783859 99771843 23488830 416711255 579380326 555316382 356296836 790456268 87744327 630813243 40309641 237064244 410353784 904326410 474731909 990859918 35853485 649988058 402228706 941002539 194538499 69830666 353983468 845868726 187254837 461163507 328722717 884417416 821754906 488338952 606803777 151454537 699058633 527938871 428786900 898401675 427005119 674036234 33420198 459862056 690568827 713741872 813587819 942050299 856895905 682312727 121668947 764479581 665467222 909744351 844500990 226415197 185733590 628060820 204016655 116303310 828312763 88817215 7559051 694641584 127344222 541812003 720616879 695306972 77094390 632040956 423324482 586638847 61543393 58169212 219111709 140237868 85647201…
Output: 1 1 2 1 4 1 7 1 1 1 1 5 6 1 1 16 1 2 1 2 3 22 1 24 1 2 1 4 1 1 3 4 1 2 1 8 1 1 2 1 4 1 1 16 1 2 1 2 5 6 7 28 1 1 1 3 1 6 1 1 1 3 1 1 6 1 1 3 1 2 6 1 1 2 1 2 1 1 3 1 23 1 1 60 1 2 1 4 1 90 1 2 1 4 1 2 1 1 5 6 7 1 9 14 1 1 1 1 5 1 2 3 4 1 2 1 13 1 2 1 2 5 6 1 1 1 3 1 2 1 1 15 1 1 1 2 1 4 1 6 1 25 1 1 1 2 1 1 1 4 7 10 1 2 13 1 40 1 2 3 1 2 6 1 1 2 1 5 1 1 2 3 1 11 1 1 1 1 5 1 7 1 1 10 1 1 2 1 4 16 74 1 1 1 4 1 1 7 1 2 1 2 3 4 1 1 16 1 1 19 1 1 1 4 1 2 1 1 2 6 1 2 3 1 2 3 4 1 2 1 1 5 1 1 2 3 17 1 2 3 1 5 1 7 1 2 1 28 1 1 3 1 1 3 7 1 2 1 2 1 6 1 1 2 1 1 19 77 1 2 1 2 5 1 7 1 1 1 4 12 1 2 3 4 17 1 2 1 1 2 1 7 1 1 1 3 5 13 1 2 1 2 18 1 1 1 3 4 6 1 8 1 1 3 1 2 32 50 1 2 1 1 5 1 1 3 1 5 6 1 2 1 1 3 17 1 2 1 1 3 4 1 8 1 1 11 1 2 3 1 1 1 7 1 1 10 1 2 1 4 1 1 1 2 9 1 2 3 1 1 3 1 27 374 1 1 2 4 1 6 1 8…

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
The Streak Back of the Woven registers - MEDIUM Coding Problem | CodeTikki