CT43170

The Redrock Streak Back

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Weaver inherited the cooperage at the canyon post of Redrock along with its curious bookkeeping system for beacons. Time to make sense of it. 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: 1865 566748387 975896437 688291435 650490122 987326705 223160136 679312429 582295865 719885816 978415391 8453465 970796151 469609892 146443341 240513973 659698849 415578477 792438945 9215671 679441823 232270908 487958498 475822305 288026410 150449757 537793736 923341980 517281277 706132701 13960812 785765337 821055091 377182986 963181111 668960260 343854935 630036103 489083323 464523379 87368086 483952449 20851533 64985677 7477527 871500272 629716448 920268503 970393247 328498439 479018806 843022131 689469489 284314957 851292584 597126594 410686809 75724697 606491923 255149304 360538705 785325451 949563833 994458055 162502121 505950126 120378408 324412695 183247046 467885821 349068968 372571369 476382201 952614966 404116339 451438767 621297292 93144644 421333169 753888509 104767020 1947913…
Output: 1 2 1 1 5 1 2 1 4 5 1 2 1 1 2 4 1 6 1 2 1 2 1 1 1 6 15 1 2 1 4 5 1 22 1 1 2 1 1 1 3 1 2 1 11 1 13 36 1 2 3 1 1 6 1 1 1 4 1 2 7 14 63 1 2 1 2 1 4 1 2 7 10 1 2 3 1 2 6 1 2 9 1 1 1 1 2 4 7 1 2 1 20 1 1 1 2 1 1 2 7 39 1 1 2 3 4 1 2 7 1 1 2 4 1 6 14 1 2 17 1 1 2 4 1 1 3 4 9 1 1 3 4 1 2 1 1 1 10 1 1 1 3 1 1 1 4 85 1 1 2 4 1 6 7 1 1 1 2 1 13 1 1 3 4 1 1 3 4 1 1 11 1 2 3 4 5 1 2 1 2 5 6 1 2 1 4 1 6 1 14 1 2 1 1 1 6 1 1 2 3 1 2 1 4 1 2 10 1 1 3 4 5 1 215 1 2 3 1 2 1 1 3 1 1 1 1 1 2 7 16 1 2 3 1 5 1 1 3 1 2 3 4 1 2 3 16 1 1 3 1 5 1 1 2 1 1 3 1 8 1 2 3 1 13 1 1 1 4 1 1 2 8 1 1 1 2 5 1 7 1 2 3 1 2 3 1 2 3 1 2 40 78 1 2 3 4 1 6 1 1 2 3 1 2 3 1 2 16 1 1 19 1 2 1 2 1 4 1 1 28 1 2 3 4 1 1 3 1 2 1 2 12 1 2 3 16 1 2 3 4 21 1 2 3 4 1 2 1 2 1 1 32 1 2 1 1 3 1 2 6 1 2 1 2 1 6 1 8 1 1 3 1 5 1 2 3 57 1 1 3 89 1 …

Example 2:

Input: 1807 255438266 738077814 802430728 63637948 750991707 886756595 97546083 748346581 804420864 516639584 643672412 119011029 161403370 616113946 191850656 544187707 163250000 76694114 958685949 145558 819518788 368667097 166294314 949679500 500366612 193227123 170402494 810417287 9460138 935382028 70542925 875060242 695699295 970119546 31533534 9196268 739317483 298808841 74174880 802141057 27122579 547830920 153265787 948470140 389482887 864199755 448909351 151828602 166497428 322008844 217648437 492034254 33046555 14271146 876365173 779000997 91575742 392467741 126164609 137846269 149419139 854293451 644998156 73183327 673258456 762886955 644691121 609792519 720313029 666168681 328219964 281971808 586627468 598338440 965162579 246340922 120318038 796759618 43407485 762690369 510939297 2728…
Output: 1 2 3 1 2 6 1 2 3 1 2 1 2 3 1 2 1 1 19 1 2 1 1 5 1 1 1 4 1 6 1 2 1 34 1 1 3 1 1 6 1 2 1 10 1 2 1 1 2 3 1 6 1 1 11 1 1 2 1 2 3 7 1 1 3 4 1 1 3 1 1 1 3 4 41 1 1 3 1 2 1 1 1 2 7 1 1 1 2 15 1 2 3 1 2 21 1 2 3 1 2 6 1 1 2 1 1 5 109 1 2 1 4 5 1 2 8 1 1 1 3 1 5 6 1 1 2 1 1 3 1 23 24 1 2 3 1 5 1 1 1 3 4 1 1 8 9 10 16 1 1 1 2 3 1 1 48 1 2 1 1 2 6 1 1 2 10 1 169 1 2 3 1 2 1 1 3 1 10 1 1 1 2 3 5 1 2 1 1 1 6 1 2 3 10 11 1 13 1 1 3 1 1 1 3 26 1 1 2 41 1 1 1 3 5 1 2 1 50 1 2 1 2 1 4 5 6 1 8 1 2 3 1 2 1 2 1 238 1 2 1 2 1 4 1 2 7 1 2 3 1 2 1 14 1 1 17 1 1 1 3 5 1 7 1 2 1 1 12 1 2 3 1 1 6 1 1 2 1 4 6 1 283 1 2 1 2 1 4 1 2 1 1 2 1 5 1 9 1 11 1 2 1 1 5 1 18 1 1 1 3 4 1 25 26 31 1 2 36 1 2 3 1 1 6 1 1 1 2 1 2 1 8 1 2 3 1 2 3 1 2 1 1 2 4 5 1 1 13 1 2 3 4 18 1 73 1 2 1 2 1 4 1 2 1 4 1 12 1 2 1 2 5 6 7 1 2 3 1 1…

Example 3:

Input: 3020 323833166 830720838 727381750 326971872 227989738 234645441 221700654 251114567 771954213 375371139 474291650 977001906 729591322 369601594 621418114 826852651 349877103 592621081 754459327 300426540 142034562 185492700 446089250 938711361 807355601 53931526 196852928 793986216 235454827 127931254 704642980 983439339 889657222 872081477 125357853 574059591 894298555 153484860 964718676 526965335 200803296 446871168 254463533 167717374 254578879 788890242 440846778 254352611 953989958 736557823 804362410 337078403 892229323 523673774 554067007 199719546 464880911 274638886 239155055 127371276 518432224 88445416 629471926 674445308 780227948 735871206 691942747 548791338 510761691 921357304 10415971 309837312 94224605 778714080 659988146 834096458 502134513 920745712 469302032 755136332…
Output: 1 2 1 1 1 2 1 4 7 1 2 12 1 1 2 4 1 2 3 1 1 2 4 12 1 1 2 3 1 1 3 32 1 1 1 2 5 1 7 1 1 2 1 1 3 7 1 1 10 1 2 1 4 1 2 1 2 1 1 1 6 1 10 11 12 1 1 1 1 21 1 2 1 4 1 6 1 8 1 2 1 1 2 4 36 47 1 1 3 1 5 1 1 2 1 1 6 1 1 2 1 4 1 6 8 1 1 3 4 78 1 1 3 1 1 2 1 2 1 4 1 12 1 1 3 4 17 128 1 1 1 2 1 1 6 7 1 9 1 1 3 1 143 1 2 1 4 1 6 1 2 3 1 1 6 1 2 1 2 3 1 1 1 21 1 2 1 1 3 4 1 1 3 1 11 1 1 14 1 2 181 1 1 1 4 5 1 7 1 9 1 2 1 2 1 1 2 1 1 19 1 2 1 1 2 1 2 1 4 8 1 2 3 1 2 1 36 1 1 1 1 4 6 1 2 1 2 11 12 1 14 1 2 1 2 1 1 7 1 2 1 4 5 1 2 1 1 5 1 7 1 2 3 1 38 1 1 1 4 1 1 1 1 9 1 1 2 4 1 6 1 2 1 2 20 1 1 2 1 2 1 1 28 1 2 3 1 1 2 1 2 3 1 11 1 1 3 43 1 1 2 1 1 6 1 1 2 10 1 1 3 1 1 6 1 1 9 1 11 1 1 2 1 5 1 18 72 1 2 3 1 1 1 3 1 2 1 2 1 2 10 1 16 1 2 1 4 1 1 2 4 1 6 1 1 9 1 1 2 1 5 1 1 2 18 1 2 25 1 189 1 2 1 2 1 4 1 8 1 …

Constraints:

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

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