CT52075

Hugo Counts the registers

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Morning light hits the pearl fisheries of Nacre Bay as Hugo unrolls the day's manifest of registers. The tally will decide the next shipment. 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: 261 291565442 701822072 685903528 16723280 388222702 910999580 796873523 138273008 75198660 534695184 170430930 703664138 960623358 643838951 5179646 988768790 59773669 216861104 631035338 107217040 562857623 551242314 58674581 976699546 154273846 494407086 318653479 108832280 464538270 302152755 462766344 105645911 960100939 771505219 869647905 674970912 253289607 112086051 172579518 868652340 32567138 812563182 812023213 342392788 337889174 244072405 853664731 500485648 953172871 528103460 724169269 840617479 979107404 873951400 913057303 130956084 643234688 906460017 114631622 80416551 98968630 378333962 167386940 761656030 111499612 160766275 14114401 347669032 137558884 970023494 360280569 450644823 647387508 820189461 75313453 775835369 843490137 902194280 852067704 143563648 4814015…
Output: 1 2 1 1 2 6 1 1 1 3 1 5 13 1 1 16 1 2 3 1 2 1 1 8 1 2 1 1 3 1 2 1 9 1 2 1 1 1 2 5 1 2 1 1 1 1 7 1 16 1 2 3 37 1 2 1 2 3 1 1 2 4 1 6 1 2 1 4 1 17 1 2 3 4 1 2 7 8 1 1 2 3 13 1 1 2 4 1 1 2 1 1 6 1 1 3 1 1 1 2 1 2 20 1 2 1 4 1 1 1 3 1 5 11 1 2 47 1 66 1 1 2 3 4 1 1 2 1 1 11 1 132 1 2 1 4 5 1 2 8 1 2 3 4 13 1 2 16 1 1 3 1 1 3 1 2 1 1 1 3 10 1 2 3 4 5 1 2 1 4 1 6 7 1 1 25 1 2 1 2 3 1 7 1 9 1 1 2 1 39 1 1 3 1 44 1 1 1 1 3 4 5 6 1 8 1 11 1 1 1 16 1 1 2 83 1 1 2 1 2 1 1 3 8 1 1 1 2 5 14 1 1 2 4 1 2 1 1 23 1 1 1 3 1 1 3 8 1 1 1 2 1 121 1 1 3 1 2 6 1 2

Example 2:

Input: 705 554381958 326559731 463463707 330421434 1251260 773056959 380238661 461052318 908826870 469884208 824635420 952904550 873836395 731881821 322774084 101758375 364473803 985369346 314276556 780116107 100288643 804730433 117147579 221026471 172370278 150698632 301806617 532731783 20290 260523457 876410783 577482757 263633084 517715935 501525726 148794691 790028626 323849377 615659553 847949049 995367331 894612401 111040716 228050276 370868408 749820937 146303917 604501995 113436821 497763436 938554214 828655738 408722799 421913469 331208189 276855380 801032832 13406821 379478862 558228082 512446118 424414529 77874716 658322210 727248475 138400707 451061120 282120330 233175680 18281846 674113474 227689660 837841203 295653140 134610505 869460861 879074482 323429377 562575501 771428020 82569…
Output: 1 1 2 1 1 6 1 2 9 1 2 12 1 1 1 1 3 18 1 2 1 4 1 2 1 1 5 6 1 2 13 1 1 2 1 1 6 1 2 9 41 1 1 2 3 4 1 2 1 2 10 1 1 2 1 1 5 1 2 3 1 1 1 7 8 1 2 1 1 1 6 1 22 1 1 25 26 1 2 3 4 1 1 3 1 9 1 2 1 2 3 1 5 1 1 3 46 1 2 1 4 1 2 1 4 1 10 1 1 2 1 5 1 2 1 1 5 6 1 1 2 1 26 1 1 29 1 1 2 3 80 1 2 83 1 1 3 1 1 2 1 1 102 1 2 1 4 5 1 2 1 4 1 1 1 4 5 1 2 8 1 2 1 1 3 1 15 1 1 2 4 24 1 1 1 2 1 4 6 7 1 34 1 2 3 1 2 6 1 2 9 1 2 1 1 2 1 4 8 1 1 2 1 13 1 2 3 1 18 67 1 2 1 1 1 2 4 6 1 1 1 2 1 4 1 8 15 16 1 2 1 1 2 4 7 1 9 1 2 30 1 2 1 4 1 2 206 1 1 2 3 5 1 2 1 1 5 1 2 1 9 1 2 12 1 2 1 2 1 1 7 1 1 3 1 5 1 2 1 1 29 1 2 1 2 1 2 7 289 1 1 2 3 1 2 1 2 5 6 1 8 1 2 3 15 1 1 3 4 1 2 7 1 9 10 1 1 1 29 1 1 2 34 1 1 1 2 4 1 1 3 1 1 11 1 1 1 2 4 5 7 1 2 1 1 5 6 7 1 2 1 1 5 1 2 3 1 1 2 1 5 1 15 1 1 18 1 1 1 4 1 2 1 26 1 2 29 1 56 1…

Example 3:

Input: 109 247433571 38533800 504814816 964485987 726306085 928809440 277658610 263838205 419343750 129503600 394192038 857506348 526104776 480729589 591838204 647339897 863226518 125130303 801419999 240013977 583235072 452076301 649545607 564676332 754748132 906568562 236195820 271795196 225657255 326726493 715100607 903287428 485407095 332272647 736992640 474739379 435824106 46362527 297773983 499899211 757531121 86052161 755355872 833329442 280209412 420755011 364867004 420293657 112451345 719476556 385243728 867198644 70715802 727390885 727484565 37077524 104175779 435875250 82114764 47230510 539766838 377301710 593548127 607250191 416343733 413947847 367391947 142570246 208629524 126123166 287390110 939655792 501030431 515983332 607978824 141213123 421911945 678726428 225061901 447085196 689…
Output: 1 1 3 4 1 2 1 1 3 1 2 6 1 1 3 4 11 1 2 1 2 1 4 1 6 20 1 2 1 4 5 6 1 1 3 1 1 1 2 5 9 1 2 12 1 2 1 2 1 6 1 20 1 2 3 1 2 3 1 1 6 1 8 9 1 1 1 1 2 1 4 68 1 2 3 1 2 6 1 2 9 1 2 1 2 3 1 2 8 1 91 1 2 3 1 2 6 1 1 9 1 1 1 3 1 1 16 1 2

Constraints:

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

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