CT56062

Hugo's Silver Ledger

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Every season at the copper works of Verdigris, someone must optimize the storeroom layout. This year the task falls to Hugo, armed only with the registers register. 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: 1879 11521033 123048107 91523290 225272084 749833878 421607944 999913478 864121893 605822815 812580466 533137730 656712977 345287889 578464885 400467670 268623224 259882476 367575006 593113451 699644483 792935587 974316988 667707145 284667074 304654437 747254601 920338277 410487646 683573051 690156028 263260711 712269583 841480063 180671973 390779009 138741436 726127217 288763322 851931722 961802531 983874315 452257477 478541316 277233140 777943776 480024058 312063515 355831319 880207058 486852322 713083970 773964504 144302755 309191398 601814715 821637417 594692817 521451812 266673264 511140593 426513886 787587867 206184947 992939666 806438825 551520992 857895752 386675868 346106501 506979641 913182380 793757481 197092738 467654057 669149861 699783528 704765289 469398123 188785195 6941419…
Output: 1 2 1 4 5 1 7 1 1 2 1 2 1 2 1 1 1 3 7 10 11 15 1 1 2 4 5 1 2 3 1 5 6 1 2 1 4 1 12 18 34 1 2 1 4 1 1 2 8 1 2 3 1 2 3 7 1 1 1 2 1 6 1 57 1 1 3 1 1 3 7 1 1 2 3 4 5 1 1 3 1 1 3 1 2 1 1 1 9 10 1 1 3 23 1 1 1 2 1 2 3 8 1 2 1 2 5 1 2 1 17 1 49 1 1 3 4 1 1 1 1 4 6 7 1 1 1 64 1 1 1 4 5 1 2 3 1 10 1 1 1 14 15 1 1 2 3 1 2 1 8 1 1 1 27 1 1 2 4 5 1 2 1 4 1 1 1 13 1 2 1 1 5 1 1 48 1 2 1 4 1 6 1 1 178 1 2 1 2 1 2 1 4 9 1 1 3 1 1 2 3 1 1 19 1 1 2 4 24 1 1 1 2 5 6 1 1 2 3 5 1 1 3 1 1 2 4 19 1 2 1 4 1 2 1 4 1 2 1 4 1 1 2 3 1 10 1 1 21 1 2 3 246 1 2 3 4 1 1 2 1 4 10 1 1 13 1 2 1 1 2 6 1 2 1 4 1 1 1 1 15 1 2 1 2 1 4 1 2 7 8 9 1 2 1 1 3 1 2 1 2 3 6 1 13 1 1 2 1 1 5 31 1 2 3 1 1 2 1 4 1 1 7 1 1 11 15 1 2 1 1 2 1 7 1 9 1 1 2 13 1 2 16 1 2 1 20 1 2 23 1 1 1 4 1 2 1 1 3 6 1 1 1 2 15 1 2 3 1 1 21 1 2 1 48 1 2 1 52 …

Example 2:

Input: 1096 978535128 524009067 929908065 495599882 285338566 113704062 725348890 491218230 976315429 240162802 751839832 616791171 304473823 714002729 225007257 641115812 960265429 194101339 97242977 613359537 954046890 732243501 22416008 831490949 281976660 624693228 248049686 943593021 821164626 821255054 882769355 183730805 489645358 235254665 659929100 225328082 926924229 198057368 404829728 140755381 719477566 931128865 532025101 210763300 408246986 825108726 483363643 962292153 661007489 921190199 774412382 55591594 413354478 876313300 873629692 673161912 431448549 80537929 446684707 517047937 49206928 431634159 296152545 342077088 448706738 299656032 322203770 292558799 56120702 423712713 573402697 72698914 623969387 295591947 678847002 107277268 986424128 247591366 828130012 684298689 72…
Output: 1 1 2 1 1 1 4 1 8 1 2 1 1 3 1 2 8 1 1 3 4 1 1 3 1 2 1 7 1 2 3 1 2 1 4 1 9 1 2 1 4 14 1 1 2 4 1 39 1 2 1 1 2 4 1 1 1 1 3 4 1 2 1 2 5 1 2 1 1 5 15 1 17 1 20 1 77 1 2 1 2 5 1 1 1 4 1 1 7 1 1 1 11 1 1 2 1 2 1 4 1 1 2 104 1 1 2 1 4 1 7 1 1 1 3 1 6 7 1 2 1 2 1 2 7 1 1 24 1 1 2 4 1 2 1 1 1 4 11 1 2 1 2 1 4 1 1 2 10 1 2 24 25 1 2 3 1 5 6 1 1 9 1 1 2 3 4 1 2 1 1 10 1 1 2 1 1 178 1 1 2 4 1 2 1 1 3 1 2 1 7 8 1 2 1 14 1 2 3 1 1 2 4 1 6 1 1 30 31 1 1 3 1 2 1 7 8 1 10 1 1 3 1 5 1 2 1 2 1 6 1 1 2 1 11 1 2 1 30 1 2 1 1 66 1 1 1 3 1 6 1 1 3 4 5 6 1 1 9 1 1 1 13 1 1 3 17 1 2 3 1 1 1 7 1 9 1 11 1 2 3 38 1 2 1 1 3 4 1 2 3 1 11 1 1 2 1 2 6 1 2 9 1 2 3 24 1 2 1 1 1 1 2 4 1 72 1 1 2 1 2 1 4 8 1 2 1 1 1 4 1 2 9 1 2 1 1 2 4 7 1 2 10 1 29 1 2 3 1 1 1 2 1 5 6 8 1 2 14 1 2 1 2 1 4 1 22 1 2 1 1 5 1 1 3 1 5 6 34 1 1 3 …

Example 3:

Input: 997 810188601 864027494 965239887 669284017 719677097 627404609 344065621 858299905 635313162 91831041 249979125 548235867 704170944 152481115 823206205 690441514 131482119 215248247 740763246 776466299 181591998 925918597 591281162 555068583 975351766 74788680 64576018 456543595 40312152 468092151 715577163 422950286 477224379 291686288 802420013 592587024 89230254 7676780 693779250 115595560 114342869 88949170 671884708 97406239 789501259 444019604 57498539 915713830 736825150 653332278 176969833 960023724 330370639 540086729 544349723 513243961 42347783 806555655 280853280 820990452 901489166 555964726 182230972 510464233 90558491 603679465 312657842 892439955 877260952 708616517 913667747 739479874 45442471 266918393 466969824 991259278 640790766 852658048 597512317 312267682 649051924…
Output: 1 2 3 1 2 1 1 5 1 1 2 3 5 1 7 1 1 2 4 5 1 19 1 1 25 1 1 3 1 5 6 1 2 1 10 1 1 1 4 1 1 1 4 1 10 1 1 23 1 1 1 27 1 2 3 1 1 6 1 8 9 1 1 2 1 5 1 7 1 1 19 1 1 2 3 76 1 2 1 1 3 1 2 1 9 1 1 2 1 2 5 1 7 1 10 11 1 22 1 1 3 26 1 28 1 1 3 4 1 1 2 4 1 2 115 1 1 1 4 1 1 7 8 9 1 1 3 1 5 6 1 1 9 10 1 2 1 2 1 4 1 1 2 1 1 6 1 2 3 1 2 1 19 30 1 1 3 1 2 6 1 1 2 1 4 1 13 14 1 1 3 18 1 2 1 2 1 2 5 8 1 1 3 1 1 3 1 34 1 2 67 1 1 2 3 1 6 1 2 85 1 1 2 4 5 1 1 8 1 1 11 1 1 14 1 1 1 4 1 2 3 8 1 1 2 1 4 5 1 1 17 1 1 3 1 5 1 38 39 1 1 2 1 2 1 2 3 8 1 2 1 13 1 2 3 1 2 19 20 1 1 2 1 5 1 2 8 1 2 1 1 5 1 1 2 76 1 2 1 1 1 1 4 6 1 2 1 4 13 1 1 1 3 1 2 6 1 1 9 1 2 1 2 1 2 1 18 1 2 1 1 2 4 38 1 2 1 2 1 2 3 6 1 1 3 12 1 1 2 4 5 1 2 8 1 60 1 1 2 4 1 6 1 68 1 2 3 4 1 2 1 1 3 4 1 1 1 2 1 16 1 2 1 4 1 2 3 1 93 1 2 3 4 5 1 1 1 3 1 1…

Constraints:

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

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