CT36245

Gilded registers Streak Back

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

The cartographer Gita has been asked to track the breeding season. On the desk lies a long table of registers 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: 2228 186489172 297659563 781969250 288258865 290570858 499325245 679998246 251816537 299977865 24814553 717072059 971547549 392694691 345901247 265317223 260535678 501423281 891363415 300278616 52399845 955398665 918488422 704871210 957888691 853448038 703402591 856576771 267903506 492600229 841649402 697297174 571075195 877906403 1183307 43342013 206097135 63960540 735191788 979919099 425458930 33476832 831158751 704995898 266741206 60186346 486897284 348535542 192881897 33504121 743639357 58025748 64261619 728126708 926064341 846261098 655498927 980576010 450054093 357150788 923903278 390518229 61475083 883129585 366315449 236966055 938989439 329929755 301177935 408472200 692958413 745944830 162641589 929695271 327665301 174877201 547908993 35457805 16974787 411755687 697904010 965013086…
Output: 1 2 3 1 2 3 4 1 2 1 8 12 1 1 1 1 5 6 1 1 9 1 1 12 1 1 3 1 2 3 1 1 9 1 2 3 1 5 39 1 1 3 1 1 1 3 1 1 1 8 1 2 3 15 1 1 57 1 1 3 1 1 3 1 1 9 1 1 3 4 5 1 7 1 1 3 1 1 3 7 24 1 1 3 1 1 2 3 1 6 1 2 3 1 1 3 7 1 2 19 1 1 2 1 2 3 1 1 8 110 1 1 2 1 5 116 1 2 1 4 1 1 7 1 9 1 1 3 4 1 1 1 3 5 1 1 2 3 5 1 1 26 1 1 2 4 1 1 33 34 1 2 1 2 1 2 5 8 1 2 1 2 1 4 1 2 7 1 9 1 2 3 13 16 1 1 3 4 21 1 2 1 1 1 4 7 29 1 2 1 4 34 1 2 1 1 2 4 1 2 3 1 11 1 2 1 4 1 6 18 61 1 1 1 2 1 2 5 1 2 1 72 1 1 3 4 5 1 2 8 1 10 1 1 3 1 1 3 1 1 3 10 1 22 1 2 3 1 5 1 1 1 3 138 1 1 2 1 5 1 2 1 1 5 11 1 2 1 4 1 17 1 1 1 3 1 1 24 1 2 1 2 1 30 31 1 1 3 1 1 1 3 8 1 1 11 1 13 1 2 1 1 5 1 2 1 1 2 3 1 26 1 2 1 1 2 6 1 1 3 1 2 1 7 1 15 1 1 2 3 1 1 48 1 2 1 4 1 2 7 1 2 3 90 1 2 1 2 1 6 1 1 3 1 1 2 1 4 9 1 2 3 4 1 1 1 4 24 1 26 1 1 2 3 5 6 1 1 2 1…

Example 2:

Input: 3041 333620770 379288669 850384408 434847367 893209857 135449309 483508822 659454503 776383389 948278578 458749659 673909898 717546568 648479080 324771828 701499562 118755368 34262434 199474008 138524183 113649956 586279506 418377819 728061665 907756985 532616571 583927145 410518307 416587129 543859016 13290076 942644041 782602040 210027819 464259802 591830110 519983748 449805680 884889564 788835644 246706113 727963933 285376738 863458797 446798153 778570036 451382634 485341358 405623972 421930447 121019195 888095374 871803307 426187983 403344222 805970325 633878239 709051780 558097205 327737814 62488867 461133335 707899975 247292319 177094801 600400467 25590623 747273471 842618825 739287299 768056278 464132270 443142957 658555309 690745455 672615710 83090817 56293266 516536490 899529462 3…
Output: 1 2 3 1 5 1 2 3 4 10 1 2 3 1 1 3 1 1 3 1 1 6 1 14 15 1 2 1 2 3 1 22 1 1 2 3 1 1 7 1 1 2 1 5 1 2 1 2 1 2 1 20 1 1 1 3 1 2 1 1 1 3 5 1 1 3 1 12 16 1 2 1 1 3 4 1 1 1 3 48 1 2 3 1 1 1 1 56 1 2 1 1 3 1 7 1 2 1 2 1 69 102 1 1 1 3 4 1 1 3 4 5 1 1 2 3 1 5 1 2 8 1 2 1 1 2 6 1 27 1 2 1 31 1 1 2 1 2 3 1 1 6 1 1 9 1 14 1 16 1 1 2 1 21 1 1 3 1 5 6 1 1 3 4 5 1 1 3 9 1 1 3 173 1 2 1 1 1 1 1 2 5 1 2 1 1 11 12 1 15 1 1 1 2 3 1 1 2 1 9 1 2 1 2 5 6 1 2 3 1 1 3 13 24 1 1 3 1 5 1 2 3 4 1 35 51 1 1 3 1 2 3 1 5 1 1 3 1 5 14 1 2 3 1 2 3 1 5 1 1 2 9 1 14 1 1 1 32 1 2 1 1 3 1 7 8 92 1 1 2 3 1 5 7 1 2 1 1 3 1 14 1 110 1 2 3 1 1 2 1 1 1 6 11 1 1 2 1 1 2 1 4 5 10 1 2 3 1 26 1 2 1 2 3 1 2 8 9 1 2 3 13 1 1 2 3 1 1 7 1 1 23 1 1 2 4 5 1 1 3 1 2 3 4 8 1 2 1 2 5 14 1 2 1 1 5 1 1 3 1 1 1 2 8 1 1 1 2 4 6 1 1 1 4 1 2 1 1 9 1 2…

Example 3:

Input: 1215 223399697 364308413 651838843 84537728 712484172 514770839 292452968 886255601 893743301 195169661 959512209 466824668 369843255 418066205 635643053 580316648 580947958 286596837 638256362 386842360 929235475 955536051 305449218 442219988 602373162 289680787 668306193 747837590 734870679 403570471 637200560 86263545 714341666 541941608 569357693 683902151 422782478 697067551 400642134 17572933 125931878 699705694 484854931 782910160 112571319 756955058 736892520 224243962 332152712 11302524 760059527 221081840 831334740 859896507 823734574 779278116 26427903 112746058 722464132 320316252 389939735 88765742 568215828 630011986 417599378 6969399 360166651 543296258 316772631 19847598 921924163 536367459 680344559 767127369 631194798 954334879 484905950 92295332 577053578 113125677 31448…
Output: 1 2 3 1 5 1 1 8 9 1 11 1 1 2 4 1 2 1 8 1 10 11 1 2 3 1 5 6 1 1 2 1 4 1 2 3 1 5 1 1 2 9 1 22 1 2 1 1 2 1 7 1 31 32 1 1 1 2 3 1 2 1 4 5 1 1 2 4 1 1 49 1 2 3 1 54 1 1 3 1 1 3 4 1 2 10 76 1 2 1 4 1 93 1 2 3 1 5 1 1 1 3 1 5 6 1 2 15 1 2 3 1 2 1 4 1 1 3 4 1 2 11 15 1 1 1 1 1 1 4 1 9 40 1 1 2 4 1 2 1 48 1 2 3 4 1 2 3 1 5 1 2 12 1 1 15 1 1 1 2 1 4 1 2 3 1 2 1 4 14 1 2 1 2 1 4 1 2 3 24 1 1 3 1 2 1 7 1 2 10 1 1 3 1 1 1 3 4 9 1 45 1 1 2 1 1 6 1 2 1 10 1 2 1 1 3 1 218 1 1 1 4 5 1 1 3 4 1 1 3 1 9 1 1 3 1 1 2 4 8 1 1 20 1 22 1 1 2 31 1 1 1 4 1 1 3 1 2 1 42 1 1 2 1 4 1 1 3 1 2 1 2 1 2 57 1 1 3 1 2 1 1 3 6 1 1 1 1 14 1 2 3 1 5 1 2 79 1 1 2 3 4 1 6 7 1 2 3 1 12 1 1 3 1 5 1 1 1 3 23 1 2 1 1 1 2 1 2 9 1 2 3 1 1 3 1 2 1 7 20 1 1 2 4 1 2 7 1 2 1 1 5 1 354 1 2 1 1 2 3 7 1 2 1 11 1 1 2 1 1 6 1 2 3 1 1 6 1 1 1 1 …

Constraints:

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

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