CT36795

The Streak Back of the Jasper registers

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

The store warden Trader has been asked to fulfill a tricky customer order. 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: 2448 682987357 614409756 101344821 420328291 346508179 515758519 412414940 193043205 735792330 642723932 815129573 880344007 763380626 740223176 421384655 975134736 605170770 710377620 877822093 909059729 795721666 370207953 792009991 681216910 459270969 102098916 509634938 718084977 174006533 403633043 191713167 251778228 864906194 936652175 763526251 701104516 993011388 634875913 132343387 530599447 938053690 732041389 850727797 645144790 219483080 237097496 925119752 598966338 460174238 300994153 951849763 833230937 1391254 321526185 301129200 599828416 958358889 213609464 745803706 496777538 267926350 407083409 997513856 551398688 63994575 44904635 6627286 758293117 161371281 96044463 667094616 93212139 909912677 462059614 287503049 604097397 568893540 74891796 503796357 594991169 9796…
Output: 1 1 1 2 1 4 1 1 9 1 11 12 1 1 1 16 1 2 3 4 1 1 2 1 1 1 3 5 1 2 1 2 13 18 1 1 37 1 1 2 4 1 2 1 1 2 6 1 1 1 14 1 1 2 1 4 20 1 2 1 1 2 63 1 1 1 1 5 1 1 3 1 10 1 1 3 1 1 2 4 18 1 2 1 4 1 2 1 8 1 1 3 4 1 6 1 1 2 1 11 101 1 1 3 4 5 1 2 8 1 1 1 4 1 1 3 1 5 1 2 8 1 2 1 12 1 1 19 1 1 2 3 1 2 7 1 2 1 30 1 2 3 1 1 1 4 1 2 1 4 1 1 3 4 5 1 7 1 1 2 1 1 5 22 1 57 1 1 3 1 1 1 64 1 2 1 76 1 2 1 4 1 2 1 2 1 1 2 6 1 1 2 12 1 18 1 2 1 2 1 1 5 1 2 1 2 1 4 1 13 1 17 1 19 1 1 1 1 118 1 2 1 1 1 3 1 5 6 10 1 1 1 2 1 6 1 2 19 1 2 1 1 5 6 1 1 3 1 2 1 4 1 34 1 1 37 1 2 1 2 1 2 1 8 1 1 2 1 4 1 2 1 9 1 56 1 2 1 4 1 1 3 1 1 1 4 8 1 1 3 1 1 3 1 2 6 7 1 20 1 1 27 1 2 1 2 1 4 34 1 2 1 2 3 1 2 8 1 2 1 1 2 3 5 6 1 1 1 12 1 2 1 4 1 2 27 1 2 3 1 1 3 1 5 9 1 1 3 4 1 2 3 1 2 3 4 5 1 23 1 1 3 1 2 1 7 1 1 3 1 5 1 2 3 39 1 2 3 1 5 …

Example 2:

Input: 2303 169803930 80184971 364610437 39131747 94462374 56441373 559420061 578265453 66107014 868976064 339185177 244129883 857494975 627128909 831865628 745537797 103263490 67637826 362487288 996960173 653723171 710325343 840708166 483157504 190632332 799604537 402733209 554258377 251494139 634870850 612479499 324136103 966534918 127055886 593193258 9990441 120956238 638199655 116066713 780501541 946114506 953573075 318922939 439194716 127982550 947118166 555172210 214563912 884224190 40134848 249818994 88904065 414179993 280951054 667936711 887673405 663231802 344666622 260549123 154653318 252273991 545404949 963384273 901976573 19192824 583560090 651483908 454009604 668074933 791186691 466202464 16561754 911437662 842692864 990112532 968718160 648854286 698946808 21281948 256181788 85874487…
Output: 1 1 3 1 2 1 7 8 1 10 1 1 3 1 2 1 1 1 3 20 1 2 3 1 1 3 1 2 1 4 1 1 13 1 2 1 2 5 1 7 8 9 1 2 1 4 1 1 3 1 2 1 4 1 6 10 1 1 1 1 2 5 30 1 1 2 3 1 5 6 1 1 10 1 55 1 1 2 1 2 1 6 1 2 1 1 3 12 1 1 15 1 1 19 1 21 1 1 3 1 1 2 1 1 3 1 2 12 1 2 1 4 1 2 1 1 5 1 2 8 101 1 2 1 2 3 1 1 1 2 1 2 10 1 2 1 1 1 2 5 1 1 2 4 1 2 3 8 1 27 1 2 3 4 1 1 3 158 1 1 2 3 1 6 1 1 1 10 1 1 2 1 2 5 7 1 1 3 1 2 1 14 1 1 2 18 1 30 1 1 2 1 4 1 37 38 1 1 1 2 1 2 1 1 5 10 1 1 2 3 1 1 1 2 9 1 1 3 1 1 1 7 8 1 1 11 1 1 14 24 1 1 3 1 1 1 3 5 6 82 1 1 2 1 2 1 2 7 1 1 3 4 1 6 1 2 1 4 1 6 1 2 1 2 1 2 26 1 2 1 1 2 1 2 8 1 2 1 39 1 1 3 43 1 127 1 1 2 4 1 1 7 1 1 2 1 1 13 14 1 2 1 4 1 2 7 1 2 1 4 1 6 1 8 1 2 1 4 13 1 1 2 1 25 1 1 3 1 1 2 1 1 2 7 1 51 1 2 1 4 1 2 1 1 3 1 2 1 7 10 1 2 3 14 1 20 1 1 1 4 1 2 1 8 1 2 1 1 2 6 1 8 1 1 2 3 1 6 7 …

Example 3:

Input: 3658 307293848 512888823 208961384 340446379 795318409 970357327 531812821 753724644 474912553 633571226 342003718 70202410 514686168 680722074 709341895 910761270 44731849 798080820 712985349 4065668 847627239 801261519 320792485 813270905 422086776 859744095 603353953 642653122 94582567 286083139 270785135 533910525 916164225 964240684 235803913 723356313 45027176 274045456 492563649 300113738 53143880 873936456 176940962 179895409 94759087 159216306 395224753 502215705 728750174 412556998 29082464 203721254 672352047 675696301 59913618 462842028 827368964 884691724 555954564 410195512 114586802 917131555 642519399 563625334 493507199 235994721 948561217 380313912 110819927 219834221 954001477 953419674 203834446 593724929 571326098 694570250 867392541 669801412 201246683 331681419 84429…
Output: 1 2 1 2 5 6 1 2 1 2 1 1 3 6 7 10 1 2 1 1 5 1 1 3 1 10 1 2 1 2 1 4 27 28 1 2 1 2 3 1 1 8 1 2 1 2 5 6 7 1 1 2 4 5 1 2 15 24 1 1 1 28 1 1 1 1 33 1 1 2 37 1 1 2 1 4 5 1 1 2 4 1 1 1 4 1 2 1 2 5 6 11 12 1 1 3 1 5 1 7 1 2 3 1 12 1 14 1 2 17 1 2 41 1 2 1 1 3 6 1 1 2 10 1 1 54 1 2 1 4 1 2 1 4 1 1 3 66 1 1 2 4 1 1 3 146 1 2 1 1 3 1 5 1 7 1 2 1 2 14 1 1 2 3 4 1 1 7 1 2 1 2 5 1 2 16 1 1 3 1 1 3 23 1 2 1 27 1 2 1 1 2 3 1 5 6 1 1 2 10 1 13 14 1 2 1 2 19 1 1 2 1 2 1 7 1 217 1 2 1 1 1 2 4 5 1 2 3 9 1 1 12 1 1 2 3 4 5 1 2 24 1 2 1 4 1 1 7 8 1 1 1 4 5 1 1 1 1 4 6 1 1 1 10 1 1 18 1 2 1 2 1 1 5 58 1 1 1 2 3 1 7 1 2 1 2 1 4 1 2 16 1 2 3 1 2 1 1 1 9 26 1 2 3 4 5 6 1 1 3 1 2 3 1 14 1 16 43 1 2 3 1 1 2 1 1 6 1 1 1 4 1 12 1 2 3 1 63 1 2 1 1 1 3 5 1 2 1 1 3 4 1 2 1 10 1 2 1 4 5 1 7 88 1 1 2 1 2 1 4 1 2 9 10 1 1 1 1…

Constraints:

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

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