CT39018

Zia's ledgers Streak Back

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Legend says the vault under the ember mines of Cindercrag opens only for a perfect tally of ledgers. Zia means to find out. 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: 1299 381273161 889999237 398646732 451757884 502811093 662083743 716613820 541973123 230055259 778555530 29566011 809873421 423378946 937040022 544321109 677505090 150449704 710541738 273891223 323458753 101809883 403576711 200574741 954685638 160294421 775740476 377120131 944655177 344722522 17930668 257482460 842077744 327130453 45206848 616227635 798136577 704553245 359036859 710846117 532219613 678916938 437934390 219221517 919726253 538049528 222454801 436883825 205213303 914111459 610789085 100024244 430912346 326490518 456074140 934773024 824603041 556080658 907096407 462421820 532762333 10656115 512244440 636348796 981814260 693401823 908732385 790901318 489882181 458427702 244921064 529727359 634445757 521255067 867559466 199409159 123692579 448534292 334902479 754633571 612514236…
Output: 1 2 1 2 3 4 5 1 1 8 1 10 1 14 1 2 1 4 1 2 1 4 1 24 1 2 1 4 1 1 2 4 1 1 3 4 1 1 3 1 2 1 1 16 1 1 2 1 5 1 1 2 1 4 27 1 1 3 1 2 1 2 5 64 1 2 1 1 1 1 4 5 1 8 1 1 3 1 5 1 1 2 3 1 2 1 1 14 1 2 17 1 2 1 29 1 1 3 4 5 6 1 2 40 1 2 1 2 3 1 1 1 4 1 115 1 2 3 1 2 1 2 1 1 2 6 1 8 14 1 1 1 4 1 20 1 2 1 1 5 1 2 1 1 10 1 2 1 34 1 2 1 2 1 4 1 2 7 1 2 3 1 2 1 1 3 1 10 1 21 22 1 1 3 1 2 1 1 1 2 5 1 183 1 2 1 1 1 2 3 1 1 2 3 1 11 1 13 1 1 16 1 18 1 2 3 1 1 1 4 1 2 30 1 1 2 3 1 2 1 2 3 1 7 1 2 13 15 1 2 1 2 1 2 1 23 1 1 3 1 1 2 1 1 32 1 1 1 2 1 2 69 1 1 1 3 4 6 1 2 3 4 263 1 2 1 1 2 6 1 2 9 1 1 2 13 1 2 3 1 2 1 2 1 2 1 2 7 1 1 3 1 1 3 1 2 1 17 1 2 1 1 2 3 1 2 1 1 8 1 1 1 12 14 15 16 1 1 1 4 321 1 2 3 1 2 3 7 1 1 2 3 1 2 1 7 1 1 2 11 1 14 15 1 2 1 1 2 1 5 1 2 1 4 1 2 3 1 31 1 1 2 4 1 2 1 4 1 2 11 1 1 2 1 1 1 7 …

Example 2:

Input: 1260 732817848 906006150 22468640 993831623 834374410 30519259 30613695 254947753 135099913 416793770 272406331 704864168 775359940 128618509 209873238 256669367 521927078 901918628 37901691 683701171 379574382 560822483 798611616 752856542 908616201 996144430 322780087 124970208 100214395 691732366 473035095 213501435 565589642 591064868 380651476 509330068 534946881 802567937 373475014 693317275 251578947 452283961 370781711 275521761 37891886 935253452 93854239 133969287 610675311 410287242 462074602 692338891 69986161 782475145 299941312 731396986 791061510 47007554 172383188 634618693 578231631 363178856 502991936 887397070 412716426 523190423 188718866 700990440 716074317 21880241 971922382 850831991 321187212 196086457 557653171 804270888 707513867 621343206 487656296 934202145 9963…
Output: 1 2 1 4 1 1 2 3 1 5 1 7 8 1 2 3 4 14 1 2 1 2 5 1 21 26 1 1 1 4 1 1 3 4 1 2 3 12 1 2 1 2 1 1 1 20 1 2 3 1 2 6 1 8 1 2 11 1 2 3 1 1 2 18 1 2 1 4 5 1 45 1 1 1 3 4 1 1 1 9 81 1 1 2 1 5 1 7 1 2 1 1 3 1 7 1 1 1 4 12 13 1 2 1 2 3 4 1 1 2 10 1 1 13 1 2 3 4 5 6 1 2 3 1 1 3 1 1 1 10 1 2 1 1 3 1 2 1 7 1 2 12 1 43 1 1 1 3 1 1 2 3 5 10 1 2 1 2 5 6 1 8 1 83 1 1 2 3 1 6 1 2 3 1 5 1 13 1 1 2 4 1 2 1 1 2 3 1 1 6 1 9 1 1 1 1 4 21 22 1 1 3 39 1 1 1 3 1 2 7 8 1 10 11 1 1 3 1 5 1 7 1 2 3 1 5 1 2 1 4 5 1 2 1 4 1 1 35 1 1 3 1 1 1 3 1 9 1 2 3 87 1 2 1 1 1 3 1 2 9 1 181 1 2 1 1 1 4 1 2 1 1 3 12 1 14 1 1 2 1 2 1 1 22 1 2 1 1 1 4 1 2 3 10 1 1 2 1 2 5 1 2 8 1 2 12 13 46 1 2 3 1 5 1 1 8 1 2 1 2 5 1 2 3 1 10 19 1 1 2 4 5 1 2 8 9 1 11 1 1 2 15 1 1 1 2 5 1 1 8 1 2 1 1 2 1 5 1 1 3 1 20 1 22 1 2 1 2 27 1 1 3 1 1 3 49 1 1 1…

Example 3:

Input: 1665 859374083 881948559 341520244 897928362 811433973 450915439 812895438 682618028 156169420 58661976 9914130 714754387 708975355 130673349 49006081 514380503 262330389 637116615 135462270 909776610 474419850 941099405 529765955 558228874 331804057 322640379 504280033 262811690 268768833 921490156 730671313 144300397 744568628 775964020 668250500 362521086 337166813 111289786 131978134 645740542 810424464 784307990 109582755 603759869 816511139 563473873 420686668 210582062 688656425 765069902 646491109 252432493 920862266 387690780 403418062 11422267 277309961 41856612 787735689 800154018 874179456 736627926 626459344 259541846 797754698 870889071 66328341 900660189 406136028 164085184 411958260 212458225 659595443 986846905 676931986 960417655 185698580 245261963 688375315 638259015 39…
Output: 1 2 1 4 1 1 3 1 1 1 1 5 1 1 1 3 1 5 1 20 1 22 1 2 1 1 3 1 2 8 1 1 3 4 1 1 1 1 2 5 11 1 1 2 15 1 1 1 4 5 1 1 23 1 2 1 2 1 6 7 8 1 1 1 4 5 1 15 1 1 3 1 5 74 1 2 1 2 3 1 1 8 1 1 1 3 4 6 1 1 3 4 1 2 13 14 1 1 1 1 1 2 1 6 8 1 1 1 4 1 2 1 2 3 1 5 1 2 1 46 1 2 123 1 1 3 1 1 1 2 1 4 7 1 2 1 11 15 1 1 1 4 1 1 2 4 1 6 1 12 1 1 2 3 4 6 1 1 3 10 1 2 3 1 1 3 1 2 9 20 1 1 2 4 5 1 2 1 1 5 181 1 2 1 2 186 1 1 1 4 5 1 1 8 1 1 3 1 5 1 1 2 1 2 5 1 2 8 1 2 3 26 1 28 1 2 3 4 1 6 1 1 1 4 1 6 1 2 3 1 11 1 2 1 4 22 1 2 1 1 3 1 29 1 1 3 1 1 63 1 1 2 3 4 1 2 3 4 9 1 11 13 1 2 1 4 5 1 1 2 22 1 1 3 4 1 2 3 4 1 1 2 1 2 3 7 16 1 1 2 1 2 3 1 109 1 1 1 4 1 6 1 8 1 1 2 4 1 2 15 1 1 18 1 2 1 2 3 6 1 1 9 1 2 1 2 14 1 34 1 2 3 1 2 1 1 5 1 1 11 12 1 2 3 1 2 161 1 2 1 1 5 1 1 2 3 1 5 1 2 14 1 1 3 179 1 1 2 1 5 1 2 1 1 3 6 7 37…

Constraints:

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

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