CT38884

Bhanu's Ledger of beacons

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Bhanu found an old ledger of beacons in the dairy attic at the ink district of Scriptoria. The margin notes pose a precise question. 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: 623 873467006 108982839 239377938 757534720 509198236 254664016 361153518 578392578 959109870 830065969 154151152 195207018 689590195 564551270 911950005 415350837 859293521 137456807 592717247 105472104 732005406 156964988 819586762 992880684 225485474 485992651 842277244 617257198 887677396 494325421 620853587 937479519 674609217 330419166 722256938 96497766 229394781 53364028 980402492 366325763 563591372 312791609 155468586 250281782 899660712 899903034 202120739 662088742 118925841 255274282 274307317 25457865 425710811 833045731 523329929 728984595 610173764 32572578 196964496 779931016 227175397 552792198 296750081 512704483 901888928 812495648 177914666 701250668 226914326 343533380 99829092 931409605 403120889 430566010 976422475 117646005 985555799 4777562 603418550 329434936 924…
Output: 1 1 2 3 1 1 2 4 9 1 1 2 3 1 6 1 2 1 2 1 4 1 6 24 1 2 3 1 5 1 2 8 1 1 3 1 2 1 15 1 2 1 1 2 6 7 1 2 1 2 3 1 5 8 1 2 1 1 2 6 1 2 1 2 26 1 1 2 1 2 1 33 1 2 36 1 53 1 2 1 4 1 1 2 3 4 1 6 7 1 10 1 2 3 4 1 2 17 1 23 1 2 3 1 2 3 1 8 1 1 1 4 1 2 1 2 9 1 2 1 2 14 1 1 1 49 1 1 2 1 4 55 1 2 3 4 1 2 3 1 2 6 1 1 3 1 1 3 13 1 1 2 4 18 1 2 1 1 2 4 7 138 1 1 2 1 1 3 7 170 1 2 3 1 2 3 7 1 1 10 1 2 3 1 2 1 2 1 4 1 1 1 2 4 1 2 3 4 10 1 1 1 2 3 35 1 1 3 1 1 6 7 1 2 3 4 1 6 1 1 1 10 1 1 2 21 1 1 2 4 1 1 2 1 4 1 1 7 9 1 2 1 13 1 1 3 4 5 1 2 8 1 2 1 2 1 1 3 29 1 1 3 1 2 3 1 1 6 1 2 1 1 1 1 16 1 1 108 1 2 1 2 3 1 5 1 9 1 2 1 1 3 4 1 2 1 2 20 1 1 2 1 5 1 1 2 1 10 1 1 2 4 1 1 1 8 19 1 1 22 23 1 2 1 27 1 2 3 4 1 6 7 1 1 1 4 5 1 7 8 1 17 1 1 3 1 22 1 1 3 53 1 2 1 4 78 1 2 3 4 5 1 7 1 2 1 2 3 13 1 15 1 1 1 1 2 1 5 1 2 …

Example 2:

Input: 3006 246805366 780945328 558295726 577103952 658628728 617811228 944097456 557127881 947747291 683825696 968694643 782548526 856136218 920505307 24640118 476178043 524895079 122978286 469425445 178719609 753310046 966772673 541638266 400249472 688821719 246985406 889828094 78394412 90324386 548342544 770453059 764601229 398977828 172762031 551816045 386953269 391883035 163506820 250780367 275718341 253209391 570462091 102883012 982812690 879023066 468910874 184984875 135811260 80526724 696127643 850999637 254172222 90553456 698602471 21689851 938849310 464881121 526153156 277128666 390518274 323478254 322830659 767200083 800478569 22239559 372566083 649779592 337209504 411032385 845401161 385222518 393253208 452643923 541348640 442123312 156312518 462147820 32338117 930174351 434133256 320…
Output: 1 2 1 2 3 1 7 1 9 1 11 1 2 3 1 2 3 1 2 1 7 11 1 1 3 1 5 1 2 3 4 1 1 1 3 1 2 1 2 3 1 10 1 44 1 1 1 1 1 5 6 1 1 3 1 12 1 2 1 2 1 1 7 8 1 2 3 1 2 14 1 2 3 4 1 1 3 1 23 1 1 38 1 1 3 1 1 3 1 8 1 2 1 4 1 1 3 98 1 1 1 1 3 6 1 1 2 3 5 1 2 3 1 2 3 7 1 1 2 4 5 13 1 1 27 1 2 3 1 1 3 1 8 1 10 1 2 1 2 5 1 2 3 1 2 1 2 5 1 1 8 1 1 14 1 2 1 23 1 2 3 1 5 1 2 8 9 1 11 1 2 1 4 1 1 3 1 2 3 22 1 2 1 1 2 6 1 2 1 10 66 1 2 3 4 1 1 1 2 1 1 3 1 5 1 2 16 1 2 1 1 2 3 7 1 2 10 1 1 1 2 1 2 7 1 1 2 3 1 5 14 1 1 2 4 1 1 2 4 5 1 2 1 2 10 1 1 31 1 2 1 4 1 1 7 1 1 2 3 1 6 7 1 2 10 18 1 1 3 1 1 2 3 5 9 1 2 3 1 2 3 4 5 1 1 1 3 1 5 1 1 75 1 2 3 1 1 3 82 1 2 1 112 1 2 3 4 1 6 1 8 9 1 1 2 1 1 5 6 17 1 19 1 1 1 1 24 1 2 3 4 1 1 3 1 1 1 2 5 1 2 8 1 1 2 1 5 1 15 16 1 2 1 2 3 1 1 6 1 2 361 1 1 2 1 5 1 2 1 2 1 11 1 2 14 1 16 1 2 1 4…

Example 3:

Input: 2727 370500622 825560626 259699650 973123324 514404478 687868255 72280928 91787292 749892234 322655351 707793213 564573015 112566302 50797871 485676831 307202468 377216520 677377961 475385714 551921597 966110016 202318522 226187954 431488893 621820395 951846152 529746346 982922795 338392096 872871234 305741708 790096185 201972993 903726988 328941676 455227926 266780119 245574531 832449318 976974413 110161838 660389427 181909297 95057531 257515338 497030709 542581207 956524020 660366677 106135976 771085630 105408698 880698284 746559852 291419012 212987174 944777957 145058109 245435723 662541394 58358696 637922374 23623894 556934079 106361695 782509309 265462883 492841521 960602427 149546481 380347206 56309338 138196440 388983063 348090417 127857577 278936270 400706520 284489570 273552841 19…
Output: 1 2 1 4 1 2 1 2 5 1 2 1 1 1 3 1 2 7 1 2 17 1 2 3 4 5 1 28 1 2 1 2 1 6 1 2 1 1 5 12 1 2 1 1 3 4 5 8 1 1 3 1 5 1 1 1 9 1 2 3 1 2 1 2 1 9 1 2 29 1 2 1 2 5 1 1 2 9 1 1 1 4 14 1 2 1 2 1 2 1 22 52 1 1 3 4 1 6 1 1 2 3 1 2 1 4 8 1 17 1 1 2 1 2 3 1 8 1 1 3 12 1 2 3 4 17 1 2 37 1 1 3 1 5 43 1 1 2 3 1 5 1 2 104 1 2 1 1 3 4 5 1 1 3 1 1 6 1 8 9 1 11 1 1 2 1 2 5 6 1 1 9 1 146 1 1 3 4 1 2 1 4 1 1 1 1 13 1 1 1 3 1 6 1 2 3 1 1 1 7 27 1 1 3 1 1 1 1 2 5 7 1 1 3 1 1 1 4 1 1 2 8 9 1 11 1 1 1 28 1 2 1 2 3 4 1 6 1 1 9 1 1 1 2 1 2 5 8 20 1 2 1 2 1 1 7 1 2 10 59 1 262 1 1 1 2 1 5 1 1 1 3 10 12 1 2 15 1 1 3 1 1 6 1 2 3 10 11 12 1 2 1 1 1 2 5 1 7 1 1 10 1 1 2 1 4 18 1 1 3 4 5 1 25 1 2 3 4 1 31 1 1 3 4 1 1 38 1 2 3 4 1 2 7 8 1 1 3 1 2 1 2 3 1 18 1 1 2 1 1 74 1 2 3 1 2 1 1 1 1 2 8 1 1 1 2 3 14 92 1 1 2 1 4 1 2 7 9 1 2…

Constraints:

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

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