CT43597

Clerk Counts the beacons

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Deep in the ferry landing of Crosswater, Clerk studies rows of beacons entries. One clean number will settle the guild's oldest argument. 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: 2145 308446750 439525838 115228890 75329265 587733650 587698180 518855565 457331815 49244819 883115493 767758757 718519491 557586361 335625134 469972728 958997495 544299299 483431614 766791555 737516889 71203524 669966705 228193028 685797109 909858451 953100119 938673175 379246501 440243932 319278091 374742588 268054160 936836891 129898626 489885200 334516325 442373020 734175359 645960875 949427587 833222662 603111388 75965998 515219363 812955046 274900946 698374730 382541071 517418089 37698617 621181046 679585332 993095549 780429289 309156015 863803583 921018601 167839148 920105605 645088206 739858178 182955325 875449728 692721426 235857311 936363872 911330463 893190952 686415965 796599641 480682674 533864260 556420578 270314746 48735322 179714529 282771584 894895926 784018260 874635033 1…
Output: 1 2 1 1 5 1 1 1 1 10 1 1 1 1 2 16 1 1 3 1 1 2 1 4 9 10 1 1 2 1 2 1 6 1 2 1 2 5 1 14 1 1 1 2 4 1 2 1 2 1 4 5 53 1 1 3 4 1 2 1 2 1 4 1 1 13 1 1 1 2 1 2 3 1 1 2 4 11 1 2 1 2 3 1 2 6 1 21 1 37 1 2 1 4 42 1 2 1 1 3 1 1 2 7 1 1 10 1 1 1 3 1 5 1 8 21 1 2 1 1 1 2 4 5 1 1 2 1 1 3 4 1 9 1 1 12 1 1 1 4 1 1 2 1 27 1 2 1 4 1 1 7 1 9 10 1 1 3 1 2 6 1 1 1 2 1 22 1 2 3 1 2 6 1 2 31 1 2 3 1 1 6 1 1 1 10 1 2 13 1 2 1 1 1 6 78 1 2 1 4 1 2 7 1 2 3 1 1 2 4 15 212 1 1 1 1 4 1 1 2 1 9 1 11 1 14 1 1 2 4 1 6 1 1 9 1 2 1 2 5 1 2 1 9 1 1 1 13 1 2 1 2 1 1 29 1 1 1 1 3 4 1 7 1 1 2 12 1 1 3 1 2 1 1 2 3 7 1 1 2 26 1 2 1 1 1 4 1 8 9 1 1 1 3 5 1 2 1 4 1 2 21 1 2 1 1 1 2 1 1 1 4 1 1 10 1 13 16 1 2 1 2 42 1 2 3 1 1 6 1 1 3 1 2 1 1 1 9 1 1 1 3 1 5 7 17 1 2 1 4 1 6 1 8 1 1 1 12 1 1 1 4 1 6 1 2 1 2 1 6 1 1 44 1 2 3 1 5 6 1 1 1…

Example 2:

Input: 2727 869023862 84716317 805645778 595571951 163607850 221672534 612020336 587748010 630035374 967063166 37027314 678874771 241066536 805859738 30204069 294143972 190135670 591357381 708882960 605984365 5678423 504379891 818953813 975146934 319436364 986818769 40553732 545998720 102095256 661662574 826115090 258835203 10325508 847742662 111132702 111980053 568370563 279332563 124897616 489820215 70972015 633170722 906976756 532989447 887476709 699038306 894495406 780943932 168750232 510481182 663603927 33194597 891413497 274779459 551554912 524863313 174657708 320218036 216867543 846178098 727874315 894411763 62567081 345456804 60884630 162211499 115759360 183057735 857306387 13837959 432832987 873922026 652222426 408355819 86690348 379564964 612550160 542052144 637114413 772713951 64651080…
Output: 1 1 2 1 1 2 4 1 6 10 1 2 1 4 1 2 1 4 5 1 1 2 13 24 1 26 1 2 1 4 5 1 1 8 1 2 3 1 1 3 1 8 17 1 2 1 4 1 1 2 3 1 6 1 2 1 1 2 1 7 1 15 1 2 1 2 1 4 7 1 2 10 1 1 1 2 4 1 6 8 1 1 1 2 4 1 2 1 1 1 6 1 21 1 2 1 1 2 6 28 1 2 77 1 2 80 1 2 1 2 1 2 3 88 1 2 3 1 5 1 7 1 9 1 1 3 1 1 3 7 1 1 1 2 1 4 6 1 1 10 1 2 3 14 1 1 1 3 5 1 1 3 1 1 6 1 1 28 1 2 1 4 1 1 1 2 3 45 1 1 3 1 2 6 1 2 3 1 2 3 1 1 6 7 1 2 1 2 1 6 23 1 1 2 4 5 1 1 3 1 2 1 4 5 37 1 1 2 3 1 2 1 1 100 1 2 1 2 3 1 1 2 1 5 9 1 2 3 4 5 6 1 2 1 4 5 21 1 2 26 1 1 1 3 1 2 33 1 2 1 1 2 1 1 3 9 1 2 1 13 1 1 3 4 5 1 2 3 1 2 57 1 2 3 4 1 1 2 279 1 2 3 4 5 1 2 3 1 2 1 1 2 4 7 1 2 1 11 1 2 1 18 1 1 3 1 2 3 1 1 9 1 2 1 2 1 2 5 1 2 3 1 2 40 1 1 1 1 2 3 1 7 1 9 1 1 1 4 1 6 1 2 1 1 2 1 13 1 2 25 1 1 3 4 1 31 1 1 1 1 5 6 1 1 2 4 1 1 2 8 9 10 17 1 2 1 1 2 6 1 2 9 5…

Example 3:

Input: 3390 623251868 990666634 545867872 254642814 639753760 559255090 234854528 439915020 617814869 509462332 6134369 308032898 283639779 561450527 94523047 770297596 16806487 769536568 70408674 513418290 701308601 943930549 377263077 551952977 994911605 19415112 930935133 833159510 691091817 547171381 487356394 286083311 275162402 165721357 392642503 587695104 875396751 639111565 606886045 593945246 411750214 978985528 339620710 271805966 243594162 368098679 56420488 119781221 663958689 616796393 982035097 957184131 873603142 751824380 100816806 232194042 84133828 285964718 660816640 995659318 190874059 478401601 992855650 901164290 281900704 440561985 542173154 662439483 78110024 565549609 310996060 821690835 773450230 90534271 83126368 193005746 889566393 977403972 456634543 809514470 526954…
Output: 1 2 1 1 3 1 1 2 4 1 1 2 1 5 1 14 1 2 1 2 3 20 1 2 25 1 2 1 1 1 1 1 1 1 4 7 10 1 1 1 1 17 1 1 1 4 1 2 7 1 26 1 1 1 1 2 1 4 5 60 1 2 3 1 1 2 3 4 1 2 1 8 1 1 1 3 13 15 1 2 1 19 1 2 1 1 3 6 1 2 1 2 1 1 3 8 1 2 1 12 1 1 3 1 2 3 1 5 9 50 1 1 3 1 1 3 1 5 1 2 1 2 1 4 1 1 14 1 1 70 1 1 3 1 1 3 4 1 9 1 1 2 3 1 6 1 8 1 2 3 12 1 1 1 2 3 1 7 1 9 1 1 12 1 1 15 1 1 3 1 1 1 3 1 9 1 2 3 4 1 2 3 44 1 1 1 2 1 6 1 2 9 1 2 1 2 5 1 2 1 4 1 1 2 1 1 2 6 1 27 1 1 3 1 2 86 1 2 1 2 5 1 7 1 1 2 1 1 2 1 5 1 2 1 19 1 1 3 1 24 1 2 3 1 1 3 1 8 1 1 2 1 4 6 1 8 1 1 11 1 2 1 4 1 135 1 1 2 4 1 1 3 1 1 1 3 4 6 1 2 1 4 18 1 2 1 2 1 2 1 2 5 1 2 10 1 1 1 2 3 1 7 1 1 2 23 1 2 1 2 5 1 2 8 1 1 1 35 1 2 3 4 1 1 3 1 1 2 1 1 1 7 1 2 1 1 3 1 5 1 19 1 2 1 1 1 2 7 1 2 10 1 1 3 1 226 1 2 1 2 1 2 7 1 9 236 1 1 2 3 1 5 1 2 9 1 11 1 1 2 1 2 …

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
Clerk Counts the beacons - MEDIUM Coding Problem | CodeTikki