CT36556

Indu's registers Streak Back

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Deep in the salmon ladder of Rushing Falls, Indu studies rows of registers entries. One clean number will settle the guild's oldest argument. 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: 531 77269291 87137465 354980372 726658134 665695031 917999036 683208484 277692996 110210775 618164101 465117236 849848847 392641167 114059187 497612786 387491581 141046874 585661991 94338042 132408532 282012385 247818494 681160833 595064911 484698307 844982415 702442172 197233228 319717100 498786391 398056512 287013308 596723742 945363684 494800255 961837225 206900705 598743139 79887745 802969491 516421422 426186939 986283221 159665755 533847487 669162485 4653524 412813934 495977815 738999683 65369799 247705808 116029770 907032004 315903107 985195051 183057181 192630759 127434800 490040832 153746397 618279551 998023448 536908333 357295744 574521721 112436902 195521739 134055906 985126797 40430285 516809711 388262908 700914845 176020730 503070520 388057364 453022066 340759688 721048167 1432…
Output: 1 2 3 4 1 6 1 1 1 3 1 6 1 1 3 1 1 6 1 2 3 1 11 1 1 14 1 1 2 3 1 1 6 34 1 36 1 2 1 4 1 1 43 1 2 3 1 2 3 7 1 2 1 11 1 13 1 2 1 4 1 6 63 1 1 3 1 2 1 7 1 2 1 4 1 2 1 2 1 10 1 2 1 1 15 1 1 3 1 2 6 1 2 24 25 1 1 1 29 1 1 2 1 1 3 7 1 38 1 1 2 4 1 2 1 2 1 10 1 1 2 1 1 2 6 1 8 1 1 11 13 1 2 1 2 3 67 1 2 1 2 3 1 5 1 1 8 1 1 1 1 15 1 17 85 1 2 1 4 1 1 2 1 5 6 1 8 1 1 15 1 2 1 4 5 1 7 8 9 1 1 27 1 2 3 1 2 1 1 1 4 1 2 3 1 41 1 2 3 1 5 1 140 1 1 3 4 1 2 3 1 1 2 11 1 1 1 2 1 5 1 7 1 1 2 1 12 1 2 16 1 1 2 4 1 2 1 4 5 1 11 1 1 1 2 3 1 7 1 1 2 4 1 1 1 3 5 1 1 1 1 3 60 1 1 1 4 5 1 2 8 1 1 1 3 1 2 1 1 2 6 1 8 9 22 1 1 25 1 1 3 1 1 3 1 1 1 3 4 1 6 14 1 2 1 4 1 1 1 1 2 4 11 1 2 3 4 1 2 1 4 1 1 1 1 1 2 3 12 1 68 1 1 1 4 1 2 1 1 1 1 5 1 7 8 11 1 1 1 1 5 6 7 8 9 1 2 23 1 1 3 4 100 1 1 3 4 1 1 2 1 4 6 111 1 2 3 4 1…

Example 2:

Input: 2046 531775529 38954405 515118553 371992574 131818193 909039751 464840327 66143542 337762759 970527640 682488620 418818878 704441814 527995322 360535160 804048232 690046557 968831419 629626545 333997014 886054241 281143776 219031462 840993768 811456519 707204288 125972234 801541336 627981089 122445982 202137796 975610534 101073091 281136006 712353086 404889450 127443374 502352065 933977278 376384546 4715875 296138017 712138577 207581950 704697730 320387556 121178518 21176319 331613449 392221494 181333009 99137547 775800481 771124982 539922475 773397135 753137548 17771052 348739912 307955455 837092817 133964930 209297152 16352812 647994919 228914834 21398764 268344166 876426213 562091022 383675415 962179741 33532691 961736446 642800815 178134672 217088779 461773551 303442535 997830482 96853…
Output: 1 1 2 1 1 6 1 1 2 10 1 1 3 1 1 6 1 8 1 1 3 1 1 3 1 1 1 3 1 1 2 32 1 2 3 1 1 3 7 1 1 2 4 1 2 1 1 1 4 5 1 1 14 1 1 3 1 1 2 1 22 1 2 1 4 1 1 3 30 1 1 40 1 2 1 1 2 3 1 80 1 1 1 1 3 1 2 3 4 1 1 10 1 2 3 1 1 6 18 1 2 3 1 1 2 4 26 1 2 1 4 5 6 7 1 2 1 4 1 2 1 8 1 2 1 1 2 4 7 1 2 1 2 1 6 1 2 16 1 1 34 1 1 1 3 1 1 41 1 1 1 3 4 1 1 7 8 51 1 2 1 4 83 1 2 3 1 1 2 4 1 6 1 11 12 1 2 1 2 5 1 2 1 1 3 6 1 1 2 4 1 2 3 1 1 3 4 1 2 120 1 1 2 3 5 1 7 1 9 10 1 2 3 4 1 1 3 1 9 20 1 2 1 4 1 1 3 4 1 2 1 1 2 6 1 8 9 1 1 20 1 2 3 244 1 2 1 2 3 1 7 1 9 1 2 1 4 1 2 1 1 1 2 3 1 6 1 2 16 17 1 2 20 1 1 1 3 4 1 1 1 4 1 1 2 1 1 14 16 1 2 1 1 3 6 1 1 2 10 1 2 29 1 2 3 1 1 2 3 4 1 1 3 1 1 1 12 1 1 3 1 1 6 1 1 3 1 5 6 1 29 1 2 1 1 3 1 2 1 4 10 1 2 1 1 2 4 5 1 1 98 1 2 1 2 5 1 7 1 1 2 3 5 1 1 2 1 1 1 2 5 1 2 1 12 1 2 1 2 3 23 1…

Example 3:

Input: 1750 188575003 471538430 523217586 676103374 197969501 243490494 688706119 859522675 150166871 14068677 558737426 577984685 307296376 379524418 531142641 565434615 138809869 611400492 395554523 30951159 511069575 811411493 289758871 623695677 71845677 884744796 833922149 90633401 976064835 227222450 551415843 120081937 131453284 496842064 989998494 839197623 798010087 587196612 25224193 731154015 618905051 774633717 279982697 724008246 623349663 120655735 515778609 127506986 535061378 290479946 983555358 892777973 566267080 661413465 981141420 138015335 534221930 856718147 54541610 64216540 663507504 705545425 126368052 920412855 34870248 572946141 232278121 155966672 789706468 61941557 750911824 430407910 311572713 787633424 761950472 332895354 686178297 558833843 927030621 304174586 4583…
Output: 1 2 3 4 1 2 7 8 1 1 3 4 1 2 3 4 1 10 1 1 3 14 1 2 1 26 1 1 29 1 2 1 2 3 35 1 1 1 1 3 1 5 1 2 1 1 2 1 4 1 16 1 1 2 4 1 2 3 1 2 3 4 1 9 1 2 1 1 5 1 2 1 1 5 1 1 2 1 24 1 2 3 1 2 3 1 1 1 10 35 1 2 1 4 1 2 3 1 5 1 7 12 1 1 3 1 1 3 1 5 1 1 2 24 1 1 3 1 1 1 2 1 9 1 1 1 2 5 1 7 1 2 3 4 1 2 1 1 9 1 11 1 20 1 2 1 2 93 1 1 3 1 1 1 1 156 1 1 1 3 4 1 1 7 1 2 1 1 2 1 15 1 1 1 3 1 1 2 8 24 1 2 1 1 2 6 1 1 2 4 1 12 1 1 2 4 1 2 1 2 3 1 2 3 1 1 9 1 1 3 1 1 15 1 2 3 1 1 2 3 4 6 1 2 3 10 1 1 3 1 2 1 2 3 9 10 1 82 1 1 3 4 1 2 3 1 5 1 2 1 2 10 1 1 1 1 3 1 1 8 1 2 1 2 5 1 15 1 2 1 2 1 2 3 1 2 8 1 12 1 1 3 41 1 1 1 2 4 1 2 1 8 1 138 1 2 1 2 5 6 1 1 2 1 11 1 2 3 1 5 1 1 8 1 1 2 4 1 1 1 2 5 1 2 1 9 22 1 1 2 3 1 1 7 1 1 10 1 45 1 1 2 1 5 1 1 3 4 1 6 1 2 1 15 1 1 1 3 1 2 1 7 1 10 1 27 1 2 3 1 1 1 3 1 2 1 11 1 2 3 15 …

Constraints:

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

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