CT51717

The Streak Back of the Twilight beacons

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Every season at the port of Emberfall, someone must file the annual report. This year the task falls to Sarla, armed only with the beacons register. 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: 1270 284289453 718407926 599905807 936473229 937011513 855611467 513026664 106295969 670915040 615132040 588930197 513481186 563975705 993763664 1255577 589097966 617080902 168770671 372631729 629166408 59417620 490563028 919543228 438397226 802681630 315202573 964635040 403057276 108925041 765384862 386394084 695073637 599695655 161400621 3336959 591559545 486207846 682111523 22331518 272261007 614908664 241001199 512243793 313927551 639414007 265061903 789178104 628324297 840197777 405669934 846134686 76550561 854101546 24714120 245395561 359798934 948149132 210039669 267266238 871028026 801991600 972873542 347370229 370012511 654517952 325072674 533168568 65258563 299024712 344551503 822058238 252771681 177808372 996060950 837497443 723599263 870624871 848326439 288173994 823737736 4238…
Output: 1 2 1 4 5 1 1 1 3 1 1 1 2 14 1 2 3 1 2 6 1 2 9 1 2 1 13 1 1 3 1 2 1 1 1 3 1 6 1 2 3 1 2 1 7 1 20 1 22 1 24 1 26 1 2 3 30 1 2 3 1 48 1 2 3 1 2 1 2 3 9 1 1 74 1 1 3 1 1 2 1 2 3 4 5 1 2 1 2 16 1 2 1 1 1 1 7 1 1 2 3 1 5 6 7 1 9 1 1 13 1 1 1 2 1 4 6 21 1 2 1 4 1 1 2 8 1 1 3 40 1 1 2 1 2 5 6 1 2 1 11 1 1 1 4 1 1 2 4 9 1 2 1 4 1 1 2 1 5 86 1 2 3 1 2 1 4 5 1 1 11 1 2 3 4 1 6 1 8 1 1 3 1 1 6 1 2 3 1 2 12 1 1 1 1 2 1 4 8 9 1 1 1 4 1 6 1 1 2 4 1 21 139 1 1 1 1 4 5 6 1 2 1 1 1 6 1 1 3 17 1 2 3 4 1 6 1 8 1 2 3 1 1 2 1 1 6 18 1 2 1 2 1 2 7 1 1 28 1 2 3 1 2 1 4 1 1 10 1 2 1 2 15 1 2 3 1 1 2 1 1 3 4 1 2 1 1 1 2 4 18 1 2 1 2 3 24 1 2 1 2 5 1 1 47 48 1 2 1 1 2 3 1 6 1 2 11 1 1 3 1 1 1 7 1 9 1 1 2 1 4 5 1 1 1 4 1 1 265 1 1 3 1 1 1 7 8 1 1 3 1 2 1 7 1 2 3 1 1 6 1 2 1 4 5 1 28 1 1 3 1 5 6 1 1 3 1 1 3 1 8 1 2 1…

Example 2:

Input: 2519 794082805 677727740 148231510 325937698 923337110 468877208 512723354 906691690 522615496 938656739 256514395 922769031 259686849 878436762 71796828 457175728 704668088 783529328 634223313 942560476 224517592 287571732 71842024 462520441 847553204 281593348 101113821 125044285 632639013 144112623 835560453 303424871 829595425 776087938 685220607 316330280 823654148 321644128 186570188 396101345 939738888 228802693 619629801 220128201 825119997 900662026 446736600 846497385 715465817 112851430 657676815 810922846 72792180 65966990 214458098 53812285 884112142 893984770 723279767 824109763 622546076 50289485 12125847 614031878 384865397 788743960 70558006 73612520 933716166 383549133 455387179 284222737 810862217 949692047 327795625 362941183 549483819 880640993 5959553 569114077 470362…
Output: 1 1 1 2 5 1 2 3 1 10 1 2 1 2 1 2 3 4 1 20 1 2 1 4 5 1 1 2 4 1 6 1 2 1 1 1 4 1 1 3 21 1 2 1 4 5 1 2 1 1 2 4 1 1 3 1 11 12 1 2 1 1 1 3 1 6 1 2 28 1 2 1 4 74 1 2 3 4 1 2 1 4 1 1 1 3 1 10 1 1 1 3 4 16 1 1 23 1 1 3 1 1 1 7 1 1 2 4 5 1 2 3 1 1 1 7 1 1 1 3 1 6 1 8 1 52 1 1 3 1 2 1 59 134 1 1 3 1 2 1 2 1 1 10 1 1 1 4 1 6 1 2 1 20 1 2 1 4 159 1 1 2 1 4 1 7 1 2 1 1 12 1 2 1 2 1 2 5 1 7 1 2 1 2 12 13 1 2 1 4 5 1 1 2 4 1 2 1 1 5 10 1 1 33 1 1 3 1 1 1 7 1 1 3 1 12 1 2 1 1 3 1 1 8 1 2 1 1 25 1 2 1 1 2 1 1 3 6 1 1 37 1 2 1 2 3 1 1 2 1 1 2 1 1 6 1 1 2 10 1 2 3 1 60 1 2 1 1 3 6 112 1 2 1 1 2 4 7 1 2 1 11 1 2 1 1 2 6 1 1 1 2 4 12 1 1 3 4 1 1 2 4 1 1 3 1 1 10 1 28 1 2 1 4 1 1 3 4 9 1 11 1 1 165 1 2 1 1 2 171 1 1 1 3 4 1 7 8 1 1 3 1 2 14 1 2 1 1 1 4 1 2 3 24 1 1 1 4 5 1 2 3 1 10 1 1 1 4 1 2 1 4 1 1 1 2 1 14 1…

Example 3:

Input: 1374 72198121 729415132 270275756 212813000 462439650 78523299 293818779 470179031 326684336 444136505 232410260 355600287 262814936 708026496 427441896 501037161 66965846 681153838 735054455 47376173 130237925 156477000 12092643 756102077 276803313 75204218 983073788 599866978 564254375 428058784 497260321 953621834 130834774 273555001 64431919 6984635 376818785 297300949 697692269 52448210 740808285 646930481 161826556 841818872 958687942 639367505 559203965 374253798 857461337 996834937 433627294 50421378 938029735 679350770 51465461 603125452 284435429 809371344 495503982 705809590 330514301 606219158 861606644 131579522 913774187 155500011 913341398 246313628 371663691 528013594 10560210 473173499 576684274 57697687 736129863 580396614 411757290 153830729 185616272 251958096 784482501…
Output: 1 2 1 1 3 1 2 6 1 2 1 2 1 12 1 2 1 4 19 1 2 3 1 24 1 1 27 1 1 1 2 5 1 2 1 1 5 1 7 1 9 1 1 12 18 1 1 1 4 50 1 1 3 1 1 2 1 5 1 2 1 2 10 1 12 1 2 1 2 3 1 2 6 1 8 1 1 1 2 3 14 1 1 31 1 1 1 2 39 1 2 1 1 3 1 2 3 4 1 9 1 2 1 13 1 15 16 1 1 1 20 21 1 2 1 2 1 4 1 2 71 1 2 1 4 1 6 1 2 3 1 1 2 4 1 2 10 1 1 1 1 2 5 1 1 3 1 1 2 4 1 1 103 1 1 106 1 2 1 4 1 2 7 8 1 2 1 2 1 4 1 1 1 1 2 1 6 12 1 2 1 4 1 1 19 1 2 22 1 2 1 1 2 38 1 1 3 1 1 6 1 2 9 10 1 1 2 1 4 16 1 56 1 1 2 1 4 1 2 1 8 1 10 11 1 2 3 16 1 1 3 1 1 2 3 5 1 2 11 1 2 1 2 1 4 7 1 9 1 22 1 1 3 1 2 1 1 3 9 1 1 1 3 1 2 3 8 18 1 1 3 1 5 1 7 1 2 1 11 1 2 1 2 1 4 1 1 38 1 40 79 1 1 2 1 2 1 1 5 6 9 1 2 1 1 3 1 2 1 98 1 2 157 1 2 3 1 5 1 1 3 4 1 1 2 3 4 1 6 7 1 2 3 1 1 1 337 1 2 1 4 5 1 2 1 1 1 2 1 6 1 8 16 1 1 3 1 5 1 2 3 1 5 1 7 8 1 2 32 1 2 1 1 2 1 5 1…

Constraints:

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

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