CT55075

Anaya and the Streak Back

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

The council of the acacia flats of Thornveld pays by the answer, and Anaya intends to earn it. First: the full register of signals. 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: 91 422770995 37686307 953768277 428616435 398995186 274932768 995050210 202647099 791292510 635454575 509557161 117362764 558421099 859640072 430133216 265720648 48575886 187167013 956368750 498962927 597134620 113677731 787867956 421638942 443801706 465532905 427669382 466903696 942456049 188274265 157695229 305262723 218505067 392544352 332946182 56852466 556805357 689287067 63289465 364666970 288515284 780531188 32768810 724552301 176580172 406435994 222396598 824475646 987878979 725224149 634236302 48171139 919781197 552711431 954511552 308018952 712290207 368922159 405405051 160692965 910590799 277917858 14956778 146277831 970855730 295698821 809247514 761001546 24438093 21178271 468911005 306669459 279102130 596818103 254309247 369014017 247005922 644974999 83601199 811564580 8683902…
Output: 1 1 3 1 1 1 7 1 2 1 1 1 3 7 1 1 1 2 12 1 2 1 4 1 2 3 1 5 10 1 1 3 1 5 1 1 8 9 1 2 1 13 1 2 1 2 1 19 42 1 1 1 4 1 6 1 2 1 2 1 6 1 1 2 16 1 2 1 1 1 3 1 1 6 1 2 1 10 1 15 16 1 18 1 1 2 38 1 1 2 1

Example 2:

Input: 944 750772550 589474096 24051728 924727301 101208408 577745989 103980156 95845754 408425200 73539018 566447821 549720585 555384421 455917060 820026125 265517132 285674903 397673980 403129664 882610446 384041162 482228564 704714095 456977060 278522326 415373364 498102438 2123395 15210473 924396890 490984484 229473402 639540630 691704795 82515192 397679412 487448850 119531005 169820019 611711609 472125863 831579721 834639638 918685649 555482932 552238760 156206094 813180244 376126529 949853841 288429602 279829781 293866158 947084901 775818913 3759135 876683102 172025886 738417189 881391747 944912981 782269063 905441964 748398271 68306817 433501516 707022582 827143714 79621573 8842923 542329702 135357691 669458056 177156512 600151441 952206373 799643363 810007670 736509766 172397026 60453632 …
Output: 1 1 1 4 1 2 1 1 3 1 5 1 2 1 11 1 2 3 4 16 1 2 3 1 1 2 4 1 2 26 1 1 3 4 1 2 3 1 2 6 1 12 13 14 1 1 1 4 1 50 1 1 3 4 1 1 3 1 2 6 7 1 2 1 1 2 3 5 1 1 3 1 5 1 2 76 1 2 1 1 1 3 5 1 1 8 1 88 1 1 3 1 2 1 4 8 1 2 1 2 5 1 2 1 105 1 2 1 1 2 1 2 1 2 5 1 12 1 1 1 4 1 6 1 2 1 127 1 1 3 4 1 2 1 1 1 1 4 1 9 1 2 1 1 2 6 1 17 1 1 2 4 5 6 1 8 1 2 1 4 13 35 1 2 1 2 3 4 7 1 2 1 4 1 1 7 1 2 3 4 1 1 3 1 5 1 1 3 1 1 1 12 1 1 1 2 35 1 1 3 74 1 1 2 3 1 6 1 2 1 1 11 1 2 1 2 1 2 1 6 1 1 2 1 4 1 6 7 15 1 2 18 1 1 1 2 4 1 6 1 2 1 4 1 13 1 1 16 17 1 2 1 1 3 6 1 2 1 1 1 6 1 1 2 3 1 2 19 1 2 1 2 1 6 1 64 1 1 3 1 5 6 1 8 9 1 1 3 4 14 1 1 3 4 1 2 21 1 2 1 2 1 4 1 8 9 1 1 3 1 14 1 1 3 1 2 3 1 2 1 1 2 1 5 1 2 1 2 3 4 1 1 2 3 24 1 2 1 2 3 1 7 1 1 2 11 1 37 1 1 3 1 1 3 1 5 1 1 11 1 2 1 1 1 4 366 1 2 3 1 1 3 1 2 6 10 1 2 13 14 …

Example 3:

Input: 3622 493654672 574239970 247572010 413053413 724444768 971363620 38261766 197746074 929392031 142219024 47485661 38602460 589542802 220787923 667159738 229913806 482142815 322264549 929296408 541155514 324025544 864759489 892850092 316794299 193832217 887385770 95624179 267761590 255638364 550012621 185172441 1014453 301383973 328463855 334931036 658697155 955578033 50031997 465220641 719753726 62366691 436517694 16791546 107928428 207819110 482534289 812913237 92444739 396886899 797339801 514192766 908526675 613957635 659131194 326951902 816732714 589610819 453051763 569827578 11678550 744763856 698024690 952803306 481801267 375948018 319027703 800768724 952370603 537017417 560510504 749303638 64232371 649259303 108036026 866625945 750574969 938296848 476456728 178691601 313907941 4006033…
Output: 1 2 1 2 5 6 1 2 3 1 1 1 4 1 6 1 2 1 10 1 1 3 4 1 1 3 1 2 1 4 1 1 3 4 5 10 31 1 2 3 1 2 1 2 3 6 10 1 2 3 1 15 1 2 1 4 1 1 2 1 5 1 26 1 1 1 4 5 1 2 3 1 2 1 7 1 9 1 1 2 3 5 15 1 2 1 1 3 4 1 1 3 25 1 1 3 1 5 1 7 1 2 3 1 2 1 1 1 2 3 8 1 1 3 12 16 1 1 1 2 1 1 6 31 1 1 2 1 4 1 125 1 133 1 1 2 1 5 1 1 2 1 2 1 12 1 1 1 3 4 18 1 1 2 22 1 2 1 2 1 2 1 2 5 1 7 1 168 1 2 1 1 3 1 2 1 7 1 2 1 2 5 1 2 1 9 1 2 12 1 2 1 193 1 2 3 1 5 6 1 2 1 4 1 2 1 14 1 2 1 1 2 3 7 1 1 10 25 1 2 1 2 5 6 1 8 1 2 1 1 5 1 7 1 2 1 11 1 2 3 1 1 2 4 1 1 10 1 1 2 25 1 1 1 4 1 2 1 2 5 1 2 1 1 5 1 1 1 9 1 16 1 1 1 1 2 3 1 8 1 2 27 1 1 2 1 5 1 2 1 4 10 1 12 1 2 3 1 1 18 1 20 1 1 1 2 1 5 116 1 2 1 4 1 1 3 1 5 1 7 1 2 10 1 1 2 4 1 16 1 1 19 1 2 1 27 1 1 1 4 5 1 1 2 1 2 5 1 2 1 2 16 44 1 1 163 1 2 3 4 1 1 2 4 172 1 1 2 1 4 1 2 1 2 1 1 1…

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
Anaya and the Streak Back - MEDIUM Coding Problem | CodeTikki