CT36344

Shepherd Counts the registers

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Morning light hits the cedar groves of Balmcrest as Shepherd 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: 537 749757848 220791 196446500 706579717 533991943 326038143 50916378 768158169 116905468 27862974 489481836 602189059 146345622 716804104 432997622 376757703 313158242 493790576 366715943 802658612 466796125 461687615 804409369 840625877 155252304 720181933 643635103 702823411 994789187 547277589 426813242 567158482 275162977 331994201 153743028 251432926 802488834 949117867 445524302 497163864 174661746 714549276 939667937 640446218 310154617 927249334 687565755 987961588 164295788 113173777 118430159 920126301 597926433 895225656 241171699 978348195 539498855 262927905 563403482 85054826 856355661 337374650 726093112 453553025 400630569 3881973 446078202 460939094 662000066 377721697 914415910 895890425 379240843 765627669 842780956 159526255 14237812 221941183 352773227 782731339 59015…
Output: 1 1 2 3 1 1 1 8 1 1 3 4 1 6 1 1 1 4 1 20 1 1 23 24 1 2 1 2 29 1 1 3 1 2 1 2 8 9 1 2 1 4 5 1 1 3 1 19 1 1 2 4 1 2 1 8 1 1 3 1 5 1 2 1 1 1 3 5 6 1 15 1 1 2 3 1 1 3 4 5 1 7 1 1 29 30 1 1 2 4 1 2 1 1 3 40 1 2 3 1 5 1 1 8 1 2 3 12 13 1 2 1 2 1 1 2 1 9 1 1 3 13 1 2 1 1 2 19 1 34 1 1 37 1 2 3 4 5 1 1 1 2 5 1 2 3 4 1 16 1 2 3 1 5 1 1 8 1 1 1 2 4 6 1 16 1 2 3 4 1 6 1 1 2 10 1 2 3 1 124 1 1 1 2 3 1 6 132 1 2 3 1 1 1 1 8 1 2 1 4 1 2 3 1 1 2 1 2 5 1 2 1 1 26 1 2 3 4 1 6 1 8 1 2 3 1 1 1 4 5 1 1 3 1 5 1 1 16 1 1 3 4 29 1 1 1 4 1 2 3 1 38 1 2 3 1 1 1 3 1 2 7 1 2 236 1 2 3 1 2 1 7 1 1 2 3 4 1 1 2 1 1 6 1 2 3 22 1 2 1 4 1 1 2 8 1 2 1 4 5 1 7 16 1 1 2 4 1 2 3 46 1 1 2 1 5 1 1 319 1 2 3 1 2 1 2 3 1 1 1 1 13 1 2 1 1 5 1 7 1 2 1 11 1 1 2 3 1 2 7 1 2 3 1 1 2 1 1 5 1 1 12 1 1 22 1 2 3 1 2 3 4 1 2 7 1 2 3 1 1 2 1…

Example 2:

Input: 1666 138374566 160773853 476648833 79528741 436971857 522093438 844166941 795838258 401699409 700299581 81311985 29274900 719820974 887941202 411660919 105469068 117482113 463778100 859806279 292135425 605055829 822643932 716109404 614091942 410680840 697236943 304152442 532758040 152156142 492233661 187543450 849961010 573492981 814519858 242192241 914254509 472704018 100518933 209261139 63980168 964354921 801369828 716592690 922590294 257314780 46314855 932058036 606177519 548387241 180836422 40287740 334123625 833727061 536834315 636215207 496591363 871929052 691273176 369854532 923420838 740087088 687606669 290815974 358381195 83332695 758386331 505097832 792382484 884758621 204362406 943013728 185161948 613681586 321767042 642651033 26720552 897963946 398319804 997186859 201938688 811…
Output: 1 2 3 1 2 6 7 1 1 2 1 1 5 14 1 1 2 4 5 1 2 3 1 1 1 3 1 2 1 2 1 13 1 2 1 36 1 1 2 1 41 1 1 3 1 1 6 1 1 1 1 3 6 1 2 1 10 1 1 13 1 1 1 2 1 6 1 8 9 1 30 1 2 1 4 1 6 1 79 1 2 1 2 3 1 5 1 1 10 1 2 1 4 5 1 2 1 2 3 11 1 1 1 104 1 2 1 2 1 1 7 1 2 1 11 1 2 1 2 1 4 1 1 3 1 2 1 1 14 1 1 3 1 1 2 7 1 1 2 1 12 1 2 1 4 1 1 7 34 1 1 37 1 2 1 2 3 4 1 6 7 1 1 2 1 14 1 64 1 2 1 1 2 1 4 1 1 8 11 1 2 3 4 1 2 1 4 5 1 1 1 4 1 15 1 2 18 1 1 1 1 2 4 1 1 7 9 1 2 13 14 1 1 2 18 19 1 2 3 1 117 1 2 3 1 1 1 3 1 2 3 1 9 1 14 1 2 3 1 5 1 2 8 1 1 25 1 2 3 1 1 3 1 8 1 2 1 4 1 6 40 1 1 3 1 1 2 4 1 6 7 1 1 3 4 12 1 2 1 2 5 1 1 20 1 25 1 2 1 2 1 1 2 3 4 10 1 2 3 1 5 1 42 1 2 1 4 1 1 2 3 1 6 1 12 1 2 3 4 1 6 1 2 103 1 1 3 1 5 1 1 1 2 1 11 1 1 2 1 2 1 4 1 6 7 1 2 1 2 14 1 1 2 18 1 20 33 1 2 3 140 1 1 2 4 1 1 7 1 2 10 11 1 1 2 1 …

Example 3:

Input: 3150 900538006 653165491 857569910 95826259 947798179 839269171 120798761 750330629 733656369 28395258 4122903 278737933 743414048 286709304 113886025 635984377 776187728 15001392 349848060 764419796 6315619 195654483 403300267 296406233 153697786 253296553 686811192 850504328 570092507 757096477 398302391 703105689 94865061 57449143 26364468 145501020 687038362 492396864 955291103 296809798 107748519 538813147 389193899 731670721 771438577 859428952 524570914 270887733 696058457 922075562 738125683 712564387 587674183 628239292 769113733 996683413 331402926 808266405 750776444 623500582 559326333 364019887 529543317 183367540 676753274 263238973 228105225 883454432 407537113 832940306 215481208 350179902 112466519 432950075 357256741 886623798 74972304 57727900 925484930 588702912 8467675…
Output: 1 1 2 1 5 1 1 2 1 1 1 3 5 1 1 3 11 1 2 3 1 2 3 1 1 2 7 23 1 2 1 2 1 1 1 4 5 1 39 1 1 3 1 5 6 7 1 1 3 11 1 1 1 2 5 56 1 2 1 1 1 1 2 1 6 1 1 12 1 2 1 2 1 4 1 20 1 1 23 1 2 1 2 3 6 1 2 3 1 1 12 1 1 1 2 3 1 6 7 1 1 11 12 1 1 2 3 52 1 2 3 4 1 6 59 1 1 3 1 2 6 1 2 3 10 1 1 13 1 1 2 4 1 1 3 1 5 6 7 1 1 2 1 16 1 2 3 1 1 6 1 2 1 1 27 1 1 158 1 1 1 3 4 1 7 1 1 2 1 1 13 1 2 1 2 1 2 3 6 9 1 2 12 1 2 3 1 5 6 1 1 3 1 11 1 2 1 4 1 1 1 2 1 5 1 2 49 1 1 2 1 1 3 4 5 1 1 3 12 1 2 1 16 1 2 1 2 3 1 1 3 1 8 1 2 29 1 1 1 3 1 1 7 1 1 2 3 1 1 3 4 5 1 7 1 1 3 4 1 53 1 2 3 1 2 59 1 2 1 1 3 4 1 2 1 4 1 6 1 2 13 1 2 18 1 2 1 4 1 6 1 1 3 1 2 6 1 2 3 10 1 1 19 1 1 1 3 42 1 1 1 1 2 5 1 1 1 3 1 2 1 8 1 2 1 2 5 1 2 1 2 1 1 1 8 1 2 3 1 2 27 1 1 30 1 2 1 2 5 6 1 1 3 4 1 6 1 49 1 2 3 1 2 1 1 58 1 2 1 4 1 106 1 2 1 4 5 1 1 3 1…

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
Shepherd Counts the registers - MEDIUM Coding Problem | CodeTikki