CT44936

The Streak Back at Tidewater

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

The reckoner Vani has been asked to reconcile two mismatched ledgers. On the desk lies a long table of marks readings. 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: 2825 7599678 707762374 857028913 921524062 435250681 639182921 774136412 433472060 963500098 941237252 414684741 745691972 473437718 237220321 447946141 93804473 145576621 5817236 710111973 412936136 291474760 551697496 908024366 321992 341440706 154638029 756268999 378717483 777505356 359650247 844139348 749398486 594260910 234419637 278719308 739517287 158488107 579064025 118089196 801903334 324467573 486587786 201382379 361911953 509012691 521118819 747644256 273587088 29105679 445090369 180771179 671261494 454147038 665124059 501288569 778288729 325802518 287711168 406198651 529983271 963148567 288926429 90080918 591484153 492451447 603330841 147021413 170291001 49491275 650804730 873959200 90969916 125294938 809549546 241738768 928223236 719553592 429248152 779626634 248567245 6132030…
Output: 1 2 3 4 1 2 3 1 9 1 1 2 1 1 2 1 2 1 7 1 1 3 13 1 2 1 4 1 6 1 8 1 1 1 2 4 1 2 1 9 1 2 1 2 5 6 7 1 1 3 1 5 1 2 1 16 1 1 3 4 52 1 1 3 1 5 1 2 1 9 10 1 2 3 1 15 1 1 3 1 2 1 1 1 9 1 26 1 2 1 2 3 4 5 6 9 1 11 1 13 1 1 1 3 4 1 1 8 1 23 50 1 1 2 1 4 5 7 1 1 3 1 1 1 2 1 9 17 1 2 1 1 2 3 74 1 1 2 1 5 1 1 3 1 5 1 2 8 1 2 11 1 1 14 1 21 1 1 1 3 1 2 6 7 1 1 10 1 13 35 1 1 173 1 2 1 2 5 1 1 2 9 1 1 1 1 3 4 1 2 8 1 2 3 1 14 1 1 3 1 1 3 4 1 1 3 1 1 3 7 1 1 10 1 1 2 35 1 2 3 1 1 2 1 2 6 1 8 1 10 1 1 3 1 2 3 1 1 1 4 11 1 2 1 4 1 2 3 1 9 10 1 1 3 1 2 1 7 1 1 1 4 1 34 1 1 2 4 1 1 41 1 2 1 55 1 2 1 1 5 1 1 3 1 5 1 114 1 1 3 4 1 6 1 1 2 3 11 12 1 1 3 1 1 1 2 1 1 1 3 8 1 11 1 315 1 2 1 4 1 6 7 1 2 1 2 1 1 1 1 5 1 2 1 20 1 2 1 1 1 2 4 1 7 1 1 2 3 1 6 1 8 1 2 1 2 1 6 1 1 3 10 19 1 28 1 2 3 1 1 6 7 8 37 1 1 62 1 2 …

Example 2:

Input: 3521 741900419 158504871 782701830 357919639 319014644 124525856 347936419 902205680 743885303 108060897 406439074 388322884 650864587 576878222 117326090 352746955 347580292 616746334 239707065 835676105 388028577 491266982 991139440 260171410 404946150 956924942 143055883 66822052 60040430 909921744 909822061 871671427 957197567 803497002 319216498 513031361 10695004 702790729 583887488 355971260 243238508 524820674 63274139 485276078 208274526 898070841 455014286 503967620 970947632 869691343 328579993 508819276 604227583 878957006 423686555 124454037 763439136 110583655 883656257 696598988 128706611 347933740 375950383 623854889 772286052 76535514 325836638 938112202 908439827 18474360 263652789 55952122 206192131 523592374 241116578 950598644 883721475 229587827 366153753 464539463 20…
Output: 1 1 3 1 1 1 3 8 1 1 2 1 4 1 1 2 1 5 1 12 1 2 23 1 2 3 1 1 1 4 1 1 10 1 1 2 1 4 1 1 1 3 1 2 1 13 1 2 26 1 1 2 3 5 1 1 3 1 10 1 1 2 3 4 6 1 2 19 1 1 2 1 2 5 1 27 1 1 2 3 1 5 1 2 1 9 11 1 40 1 1 3 1 5 1 1 3 75 1 1 2 1 1 2 1 4 9 10 1 1 13 1 2 3 1 2 1 4 5 1 2 1 2 1 4 1 2 1 10 11 1 2 19 1 2 1 1 2 1 4 1 1 7 1 9 13 1 1 3 4 1 6 1 1 2 4 1 12 1 14 1 1 1 2 4 1 6 1 1 2 3 5 62 1 1 2 4 5 1 1 3 1 1 3 1 1 3 7 1 1 3 4 1 16 1 2 1 1 2 1 2 29 1 2 32 1 2 3 1 1 6 1 2 3 1 43 1 1 2 1 48 1 2 1 4 1 1 3 1 1 2 1 2 1 6 15 1 1 3 19 1 2 1 2 3 1 1 6 1 1 1 2 3 4 34 1 2 3 1 5 6 1 2 1 1 3 4 13 1 2 271 1 2 1 4 5 6 1 8 1 1 2 1 2 1 2 16 1 2 3 1 1 1 2 1 1 5 1 7 1 2 15 1 2 1 4 1 1 3 1 2 3 11 27 28 1 1 1 48 1 1 2 3 1 1 2 4 1 1 2 1 13 14 1 2 1 4 1 1 2 8 1 24 1 1 1 3 4 6 1 2 1 10 1 2 1 4 1 6 1 1 19 1 93 1 2 1 2 5 1 100 1 1 1 2 1 1 7…

Example 3:

Input: 1032 971923601 709479548 814985649 703787825 852405313 60500538 803265263 126466208 226294928 185645197 112261410 410565366 395347680 610694141 316167848 818814710 304861154 225986042 490316296 514581396 159020030 189251200 456615246 130653871 596981191 200217600 597656151 979773507 844510774 719771227 996611442 808977213 579795735 131785693 84507878 249951339 367739372 351172727 207908607 842445784 894151651 531121349 342415440 459288776 387880334 718553145 790525022 873068247 132948440 176793113 774277343 131869907 71560016 103518762 495626883 321824035 887175 713662779 366160581 766209541 92622092 22469093 677823029 894838953 454643905 235285456 941965672 35857064 556791015 740975198 710321467 994641459 270995798 542779897 2958658 336269509 673917601 713130027 31733718 971086597 1269115…
Output: 1 1 2 1 4 1 2 1 2 1 1 5 1 7 1 11 1 1 3 4 1 2 3 1 9 1 11 28 1 1 31 1 1 1 1 3 4 1 1 9 10 1 1 2 1 5 6 7 1 2 3 1 1 2 4 1 1 7 1 9 1 1 3 33 1 1 36 1 2 3 1 41 1 2 1 2 5 6 1 8 1 2 1 4 1 2 1 4 1 2 1 1 5 1 2 1 9 1 2 1 21 1 1 3 1 1 3 36 1 1 1 3 5 1 7 1 2 1 11 1 2 1 1 5 1 2 1 20 1 2 3 1 2 1 2 3 9 1 2 1 4 1 2 7 1 2 3 11 12 1 2 1 4 1 2 3 1 2 31 1 2 3 1 2 57 94 1 2 1 2 1 1 3 8 1 2 1 4 13 1 15 1 183 1 2 3 1 2 1 4 1 6 1 1 12 1 1 1 4 1 6 1 1 3 4 5 1 2 3 1 10 1 2 1 1 5 1 1 3 1 1 3 1 5 1 2 16 1 2 1 2 3 1 23 1 1 2 37 1 2 3 1 1 6 1 2 9 1 1 2 1 5 1 1 1 1 4 1 1 22 1 67 1 2 1 1 1 4 7 1 9 1 2 1 4 1 1 3 1 5 1 2 8 1 1 2 4 13 1 1 3 1 1 1 1 3 1 5 1 2 1 2 5 1 2 15 1 1 1 4 5 1 2 1 4 1 2 1 48 1 2 60 1 2 1 4 1 1 1 330 1 1 3 1 1 1 1 5 1 2 1 2 10 1 15 1 1 1 4 1 1 3 4 1 2 3 1 13 1 15 16 1 1 2 4 1 1 2 1 1 6 1 8 1 2 1 1 1 3 19 …

Constraints:

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

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