CT54688

Last ledgers of Hema

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Every season at the cotton rows of Whitewick, someone must settle the inheritance fairly. This year the task falls to Hema, armed only with the ledgers 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: 1493 234607945 530348918 728080473 271446330 641684939 752210365 167678665 948736433 700253985 857227050 947528045 992561124 996884699 757366704 615364143 919023811 237105538 520811933 681931199 611622776 221207010 167641073 417206634 25211783 157200950 681780893 900903052 248088145 690346609 670010852 445894706 782768814 725934477 78470850 567970298 539208569 149383234 729619801 130882578 39553152 262936299 133680931 768553128 975318530 633140826 860402186 965449252 192551039 910240467 608979285 439075504 412728965 856096792 813531933 640651435 268841770 496533249 563408778 804388607 74663512 82493989 325249284 624881985 100251343 781832581 258732690 572778255 109824818 824376322 282070851 168296181 976957860 260981637 264774701 579864709 1788099 29138328 95823210 769330643 888279769 7703…
Output: 1 2 3 1 2 6 1 8 1 2 3 12 13 1 1 3 1 2 3 1 1 1 3 1 2 7 11 1 2 1 1 5 1 1 2 1 1 6 1 1 3 1 11 31 1 2 3 1 2 1 1 1 4 1 1 1 2 3 5 1 2 3 4 1 6 1 2 1 16 1 1 59 1 2 3 1 2 3 7 8 1 1 3 1 72 1 2 1 1 5 1 7 1 81 1 1 3 1 2 1 1 1 4 1 6 1 2 108 1 2 1 1 1 6 1 2 9 1 2 1 4 5 1 1 2 1 19 1 2 1 1 1 4 1 1 9 1 2 1 1 141 1 2 3 1 5 1 2 3 1 2 1 2 13 1 2 3 1 2 6 1 1 3 10 1 2 13 1 2 1 2 5 1 1 34 1 1 3 1 5 1 2 1 1 1 45 1 1 3 1 5 1 2 1 1 1 1 2 13 14 1 16 1 1 1 2 1 1 3 1 9 1 1 1 29 1 1 1 4 1 1 3 1 2 1 2 1 42 1 1 3 4 5 1 2 3 96 1 2 1 2 5 6 1 2 9 1 2 3 4 1 1 3 1 1 6 7 1 9 1 2 1 1 3 1 29 1 2 1 4 1 1 36 1 1 1 1 1 2 7 1 2 1 1 1 2 3 1 2 8 1 1 3 1 1 3 1 2 62 1 1 1 3 5 6 1 8 1 2 11 1 1 14 1 2 3 1 1 6 1 2 3 1 1 3 1 8 1 1 1 3 4 1 15 1 1 3 1 1 3 4 5 1 1 32 1 2 35 1 1 1 4 5 1 2 1 4 1 2 1 1 1 3 1 12 1 1 2 1 4 1 2 3 1 10 1 2 3 1 32 1 1 …

Example 2:

Input: 6 912531710 699737393 959582537 301432115 423615883 495261139
Output: 1 1 3 1 2 3

Example 3:

Input: 3743 244087691 330900112 938951537 395067343 806654618 775623833 118559082 602424747 719929424 504568656 962795898 874006482 862762348 850711880 96145362 728680561 817038900 695862199 50825607 248347409 71972110 747898237 372447617 322690626 571964952 326874429 496072895 227897854 955391502 804136924 151768908 983669991 561504808 786832529 147127991 490138612 990846225 220629099 413570627 146588254 400863789 222582727 290699023 502417358 721970951 318876475 459679392 137188583 746996228 295322518 167015486 787884908 27642110 108678234 454678511 916180445 877620580 168629162 32046249 316469807 887609198 657813649 186596096 390609337 360467180 176391820 532333319 230170457 682560545 349267405 20029254 194405699 414699456 410121826 287357823 537893811 938263739 169243231 558694132 338830337 1…
Output: 1 2 3 1 2 1 1 2 3 1 11 1 1 1 1 2 3 1 1 2 1 5 1 1 3 1 2 1 18 1 1 32 1 2 1 2 37 1 2 1 2 1 2 7 8 1 2 1 12 1 1 15 1 2 3 19 1 1 1 3 5 1 1 2 1 1 5 1 8 1 1 2 4 1 1 7 40 1 2 1 1 2 4 1 8 1 1 1 3 5 1 2 56 1 1 3 4 1 1 2 4 9 1 1 12 1 1 1 2 17 1 2 1 1 5 1 1 1 3 27 1 1 3 1 2 1 1 3 6 10 1 2 1 4 5 1 2 3 1 2 1 1 8 1 2 1 2 1 4 1 2 22 1 2 1 4 1 1 2 3 9 1 2 12 1 2 1 1 1 6 1 2 1 137 1 2 1 2 1 1 5 1 2 1 2 3 6 12 1 1 1 2 3 1 2 20 1 1 3 4 1 6 1 8 1 1 1 2 1 34 1 2 1 1 3 6 7 8 9 1 1 2 1 2 3 1 7 8 1 54 1 2 3 58 1 2 1 4 5 1 2 3 4 1 2 3 1 1 1 2 1 13 1 1 3 256 1 2 1 4 1 2 1 4 1 2 1 4 1 10 1 1 1 4 1 2 3 8 1 1 3 1 1 2 4 1 9 1 1 2 4 14 1 2 1 2 5 1 1 3 1 2 1 2 13 1 1 2 1 1 6 1 21 1 37 56 1 1 3 1 2 1 1 2 9 1 1 3 4 1 1 3 1 1 2 1 2 1 10 1 2 3 1 1 2 4 1 6 1 34 1 2 1 4 1 2 1 2 5 1 2 12 1 14 1 2 3 1 53 1 2 1 2 1 2 3 1 5 1 9 1 1 …

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.