CT55036

Rekha and the Streak Back

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Rekha the tallyman watches over the fen lights of Will-o-Wisp's stores of beacons. 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: 488 658119357 836686080 378338908 232261626 999816229 665289154 596660726 866936603 489966969 322503748 21558494 366754853 267567545 913957687 215832934 132299802 657495904 217068774 250374690 677224778 241294539 268915752 851220083 410248017 687943982 489073764 83226666 669140364 561595387 178021700 250941675 377907420 848339146 458004743 834484098 639106792 169220096 892297008 947835213 811011637 103097311 914619374 545453227 641142141 210711132 664890361 9982159 625166346 706977807 210033607 6795788 183545084 878798914 555674346 756904775 413049478 683771137 490626029 157850546 79592360 459594604 358091712 127651684 788617994 596618444 34634105 798159066 782855111 971000922 406719563 147512760 339738805 589192293 701438724 16497540 443655083 221544704 427716499 522403853 673135435 93279…
Output: 1 2 1 1 5 1 1 3 1 1 1 3 1 9 1 1 3 1 2 6 1 2 9 1 2 1 1 3 1 1 2 3 10 1 2 1 1 24 34 1 1 3 1 2 1 4 1 2 7 1 1 2 11 1 2 1 2 1 1 1 3 1 1 11 1 1 14 1 64 1 1 2 4 5 1 2 1 2 5 6 12 1 1 2 4 1 2 1 4 9 1 1 2 3 1 1 1 4 5 1 1 2 3 13 1 2 1 1 40 1 2 1 2 1 4 1 48 1 1 3 1 1 6 1 1 9 1 1 1 1 3 6 7 1 2 1 4 1 6 1 2 9 26 1 1 2 1 1 144 1 1 2 1 2 6 7 1 1 3 1 5 1 1 2 9 1 2 1 2 3 1 2 1 7 1 2 3 4 1 6 1 15 1 2 3 21 1 2 40 1 1 1 4 1 2 1 2 1 194 1 1 1 1 5 1 1 2 3 1 11 1 1 2 1 16 1 2 1 1 2 1 4 1 7 1 27 1 2 1 2 5 1 7 1 2 10 1 1 1 4 1 2 1 2 9 1 2 12 1 2 1 1 1 6 1 1 1 4 1 1 13 1 1 1 1 5 1 20 1 2 1 4 5 26 1 1 1 1 3 1 1 56 1 2 1 1 5 1 2 1 9 1 2 1 4 1 15 1 1 2 1 4 1 2 3 8 1 1 2 28 1 2 3 1 1 2 1 5 1 1 1 4 1 2 1 2 5 1 2 3 4 10 1 16 1 2 3 1 2 1 1 2 9 1 1 2 1 5 15 1 2 1 35 1 1 2 1 5 354 1 1 2 4 5 1 1 2 1 5 1 2 1 14 1 1 1 4 5 20 1 2 …

Example 2:

Input: 3075 554657470 237736555 985321028 453912812 35004923 777049060 394349387 629715671 915009029 253025029 930240436 707163890 621985990 862372503 167950884 57317938 572136927 288510566 904201783 131741315 339625127 138730841 43293758 127770771 336700272 915763718 221126543 302366575 624050298 264701346 862725192 657636656 550894876 516325797 298532814 722816694 17663189 12923434 592358754 306745448 709668333 985848496 579654520 1967942 239212083 658060213 174913313 438769238 348486259 252866480 355576545 457677399 455939118 698632999 668242169 531116436 64521009 184890831 401850298 971485121 314735969 825103979 343457862 829653131 273164728 314526041 443470893 528789741 399028649 585977708 216046549 118982939 319161679 137291655 181575013 677305424 481814138 918940622 218208743 262562585 810…
Output: 1 1 3 1 1 3 1 2 6 1 8 1 1 3 1 1 3 1 8 1 2 1 1 2 4 15 1 2 3 1 5 1 1 1 1 5 1 1 3 1 5 42 1 1 2 4 1 2 1 1 3 6 1 12 1 1 1 2 3 18 1 2 1 4 1 2 3 4 1 6 1 1 3 1 2 12 1 18 1 2 3 1 23 1 2 1 2 3 1 2 3 1 5 1 7 1 1 98 1 2 1 1 3 1 5 1 1 10 1 1 1 4 1 1 3 1 1 3 1 2 1 10 1 1 3 1 2 1 4 1 2 1 4 1 2 3 4 9 1 2 3 4 31 1 37 1 1 1 1 4 1 1 2 8 1 2 3 1 14 1 1 3 1 2 6 1 1 1 3 11 1 1 2 1 4 1 1 1 4 1 6 1 38 1 2 1 4 1 6 1 1 2 1 4 6 13 1 2 1 2 1 2 1 6 1 23 1 1 2 4 1 2 1 8 1 2 1 4 1 2 1 4 5 18 1 2 21 22 1 2 1 2 1 6 1 2 1 1 2 1 7 1 2 10 1 2 1 65 1 1 3 4 1 6 1 1 1 1 5 1 1 2 1 10 1 1 159 1 2 1 2 1 2 1 2 3 1 9 1 2 1 1 1 4 16 1 1 1 2 1 4 25 1 2 3 1 189 1 1 2 3 1 6 1 2 3 1 5 1 1 1 9 16 1 2 1 1 2 4 1 1 1 2 9 1 2 1 1 32 1 1 3 1 1 1 4 1 1 1 2 1 1 5 8 1 2 3 250 1 2 1 1 5 1 2 3 1 2 1 4 1 1 2 3 4 1 6 1 2 1 1 1 3 4 1 1 8 25 26 1 1 3 1…

Example 3:

Input: 3556 633831576 481949074 4308535 658249481 543838828 288553377 676165357 50115726 402700252 816856806 874140705 858107990 252713093 121266990 352052114 135616750 186954695 527038494 749340100 26900849 527205670 509280175 43322093 302200690 338419109 898467740 431565115 746865825 606987463 429150407 347206660 161412181 100580091 839073656 868665803 157732571 454603180 288136958 388914441 13885151 439554374 606185340 679969942 155346076 460269790 458185073 942327827 378327253 487590230 626315913 153107476 156940700 296633407 526744053 450216824 564687270 929771748 483994630 86103404 989335576 287068955 71791084 418077238 901068429 160361824 698231777 364636443 851103884 646929864 37375234 692062104 776783257 96702014 732515464 384339229 118335976 158538091 771874581 364310055 572889906 85345…
Output: 1 1 1 4 1 1 7 1 2 10 11 1 1 1 3 1 2 6 7 1 2 1 1 2 3 26 1 2 1 1 1 1 1 8 9 1 2 1 2 1 4 7 8 1 2 1 47 1 2 3 1 2 3 4 1 6 10 1 1 60 1 1 3 4 1 2 1 4 1 1 3 4 1 2 1 1 2 6 1 2 17 1 2 1 1 3 4 88 1 1 1 2 1 2 1 1 9 1 1 12 1 2 1 1 2 3 1 6 9 1 2 12 1 1 2 1 2 18 1 2 33 1 1 2 4 1 2 7 1 1 1 4 1 2 7 1 1 1 51 1 1 3 4 1 6 1 2 1 4 1 1 7 1 1 16 17 1 1 3 1 2 1 1 2 6 1 1 2 10 1 32 1 1 35 1 2 1 2 1 2 5 6 1 2 1 2 1 6 1 14 1 1 2 4 21 1 2 3 1 2 3 1 5 6 10 1 1 3 4 1 1 17 1 2 1 4 5 1 24 1 133 1 1 1 1 1 5 1 2 1 4 1 2 3 8 1 1 1 2 1 5 1 1 156 1 2 3 4 1 2 1 1 3 1 2 3 1 8 1 10 1 1 19 1 1 2 1 5 1 2 1 1 3 4 1 6 1 8 1 10 1 1 2 3 1 1 2 7 1 1 1 12 1 1 2 1 27 1 2 1 2 1 2 216 1 2 1 1 2 1 5 1 9 1 2 3 1 1 2 3 1 6 7 1 2 1 2 1 2 5 1 16 1 2 1 2 3 1 7 1 2 10 1 1 2 1 2 6 1 1 2 1 4 5 42 1 1 3 1 5 1 2 1 1 1 4 1 2 3 1 1 1 3 19 1 2 1 2 1 2 5 …

Constraints:

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

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