CT49308

Tomas Counts the signals

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Caravans arrive at the alabaster quarry of Whitestone with crates of signals, and Tomas the tallyman must account for every last one. 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: 3801 99349065 967057967 600513978 828112173 741241985 298509144 456791005 233214432 55158847 942611124 617025454 453929512 504285922 967431584 449467942 58977297 614198691 806689848 767702092 206097991 351759285 326525659 818286761 490751986 199210174 915560299 693689728 352744117 555235040 40792067 326945266 763598478 765642328 634453867 821311982 514956275 637058075 228527668 57860539 702784162 131916748 86233898 577865152 620953762 428958801 412408602 381755389 175874731 547216469 496756449 908144721 925909537 696718617 620410300 621505177 447947158 842922956 736408439 541876571 50535843 79380457 274980430 180415378 238519952 534530161 958076732 941680086 64290673 989191866 221263791 48806032 629156264 740386884 664891944 474184469 104668876 682367193 59286071 529641098 904333472 283173…
Output: 1 2 1 2 1 1 2 1 1 8 1 1 2 14 1 1 3 4 1 1 2 1 9 1 1 12 1 1 2 1 2 6 7 1 9 1 2 1 1 5 1 1 3 4 1 1 1 1 5 1 25 38 1 1 2 1 5 1 1 1 2 3 1 2 6 52 1 1 69 1 1 3 4 1 1 1 4 1 2 11 1 2 1 2 85 1 1 3 4 1 2 1 1 9 1 1 1 1 4 1 2 8 1 10 1 1 2 3 1 5 6 7 1 2 3 1 2 1 7 15 1 18 1 1 3 1 5 1 2 3 1 28 1 1 2 3 1 2 3 1 1 1 4 1 1 42 1 2 1 4 1 6 1 1 2 52 1 2 3 1 1 1 1 2 1 6 1 1 75 1 2 3 1 2 3 82 1 2 1 4 1 2 1 1 1 2 5 1 13 1 1 1 3 5 19 1 1 2 1 5 1 2 1 2 1 6 1 2 9 116 1 1 3 4 1 6 1 2 3 10 1 2 1 4 5 1 2 8 1 10 1 2 3 1 2 1 4 1 1 7 1 2 10 1 1 3 1 1 2 4 1 1 3 8 1 2 37 1 2 1 1 1 3 1 5 1 10 11 1 2 3 52 1 1 3 4 1 68 1 1 3 1 5 1 2 1 2 5 1 2 206 1 1 1 3 1 5 6 1 1 216 1 2 1 1 3 1 1 1 7 1 9 1 2 3 1 16 1 1 1 2 3 1 6 1 2 1 4 1 2 3 1 1 16 1 1 3 1 22 1 1 2 1 2 1 29 1 2 1 2 5 6 1 2 3 4 5 1 2 1 9 1 17 63 1 65 1 2 1 1 5 6 1 1 2 4 1 12 1 2 …

Example 2:

Input: 3516 997165915 801602683 595292333 185521887 379616353 586148240 124355788 379233489 335346621 68188279 271447626 431890078 630502249 379843683 972314241 656739394 832562043 869100718 914697505 499650171 319481098 193665009 776046618 533794018 126951963 728915419 962360747 936096563 463468476 334512104 637850350 326284247 174026452 245935332 284069116 515722959 715576461 137419591 960318420 876583178 497439624 252690125 527712762 764220459 459073783 601612967 591118103 107073256 251230057 378719181 749652426 762665339 188856176 963030204 893282567 199545634 619487674 735393587 184255701 863082907 59881509 527982320 663645323 711337719 525454558 49105472 232345391 831512680 768960964 986959878 462991041 605872731 163597338 398829767 813290701 9538350 856885439 236658526 398190412 232132939 …
Output: 1 1 1 1 2 3 1 2 1 1 2 6 11 1 14 1 2 3 4 1 1 1 4 1 1 3 12 1 1 1 3 1 1 2 3 5 9 1 12 1 1 1 3 4 1 2 1 1 2 3 7 8 1 39 1 1 2 3 1 5 1 2 3 4 1 1 2 8 1 69 1 2 1 2 5 1 7 1 2 1 4 1 2 1 1 9 10 1 1 1 1 15 1 1 2 4 1 1 22 1 2 3 1 1 3 7 1 1 10 1 1 3 1 15 1 46 1 2 3 1 2 52 1 2 3 1 5 1 1 60 1 1 2 3 1 2 6 7 1 2 1 1 3 4 7 1 1 1 11 1 2 1 4 1 1 1 1 4 1 7 1 2 1 2 1 17 1 2 1 4 1 2 1 2 5 6 1 2 1 50 1 2 1 2 5 116 1 2 1 4 1 2 7 1 9 1 1 1 4 14 1 1 1 1 4 5 7 22 1 2 3 1 2 1 2 146 1 2 1 4 1 1 2 1 9 1 2 12 1 1 3 1 1 2 1 2 3 1 1 239 1 1 3 1 5 1 1 2 9 1 1 12 1 1 3 1 1 3 1 8 1 2 1 4 1 1 15 1 2 1 2 3 1 7 1 36 1 2 1 1 3 1 2 1 2 10 1 2 3 1 5 1 2 1 1 1 1 12 1 2 15 1 2 1 2 1 1 5 8 1 1 2 3 1 14 1 31 1 2 1 45 1 2 3 1 1 6 1 2 3 1 1 2 1 4 9 16 1 2 1 1 342 1 1 1 3 1 6 1 8 1 2 1 2 1 1 5 1 2 1 4 5 21 1 2 1 4 1 6 1 1 2 1 2 1 13 1 1 3 1 …

Example 3:

Input: 3536 403936162 482744289 277988751 283552142 35901900 843836291 154322256 220210634 855312015 387317373 502109594 248969557 336879646 248405225 348277656 588223053 431517598 323806899 640709839 146226508 429291167 309030422 589395828 125259466 193690427 434880080 284208241 922413430 541270698 772252832 384765930 633736847 720000351 257289604 730477926 672153473 570401317 862496873 740024197 255746394 966895924 306485967 490437772 947244683 483661069 225899027 235951344 153864426 83122054 620367874 756629887 402215885 671357483 829777141 940786186 297778577 468011532 605292654 512847493 465543808 944780829 836557651 749582252 778673421 378174450 814488546 961022123 788522520 881219682 20443824 460142878 859292542 337083324 411743586 444616624 833522438 44129670 47239319 225859297 549849120 …
Output: 1 2 1 2 1 6 1 2 9 1 2 1 2 1 4 7 1 1 10 1 2 1 4 1 2 3 1 28 1 2 1 2 3 1 5 1 1 10 1 1 41 1 2 3 1 1 2 1 1 6 7 1 2 10 11 1 2 3 1 1 17 1 1 2 1 4 26 1 2 1 2 3 1 2 3 4 1 2 3 4 1 6 1 2 3 10 1 1 2 14 1 1 17 1 2 3 1 22 1 100 1 1 2 3 4 1 2 1 1 3 6 1 2 3 1 5 1 1 2 20 1 2 1 2 3 1 1 3 7 1 2 1 13 1 1 2 1 1 5 1 1 3 1 24 1 2 1 4 5 150 1 1 3 1 2 6 1 1 2 4 5 6 1 14 1 2 1 4 1 1 7 8 1 1 3 1 2 1 1 8 9 1 2 1 2 1 2 1 17 1 2 3 4 1 2 1 2 3 1 1 1 7 1 9 1 1 43 1 2 1 4 1 2 1 8 9 1 2 1 1 3 1 1 6 18 1 1 3 1 2 3 7 1 2 10 1 1 3 4 15 1 1 2 3 5 1 1 2 4 1 6 1 2 3 1 1 17 1 2 1 1 1 3 24 1 1 2 1 44 1 2 1 1 2 1 4 1 2 3 4 9 10 12 1 14 1 2 17 1 2 20 1 1 3 88 1 2 1 2 5 1 1 2 3 1 5 1 2 1 2 1 6 149 1 2 1 1 5 1 1 3 4 1 1 2 1 14 1 1 2 1 5 1 2 1 1 10 1 12 1 1 1 1 1 3 19 1 1 3 1 2 3 7 1 2 3 1 2 3 4 8 1 2 3 1 1 3 4 1 1 2 45 1 2 1 4 1 1 7 8…

Constraints:

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

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