CT45750

Miller's signals Reckoning

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Deep in the orchid house of Bloomglass, Miller studies rows of signals 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: 2017 973430408 18585619 191977255 777106584 197071900 774179580 985845367 887003465 926236126 776104149 492292090 65829047 18789444 347709972 199520130 94753213 934152249 162343203 510121376 160084329 164160763 167346687 407091468 735089576 17355073 416724101 47449494 128482548 135610212 883932619 982523508 350999602 357928543 234841932 780378470 367000418 247662365 409318711 533374049 113032947 488457013 741112934 512864924 148807928 420866512 86022998 817513251 307182260 470472351 287781712 625357772 621447464 747457081 205954958 701408550 381876603 370822861 996007698 587428148 912446159 926894941 508543002 972621955 821155458 700812340 364443016 687766437 17903330 844833785 579031294 242949671 573538528 880871787 818151745 415668730 91718855 609148859 791352252 566387015 120725947 4419…
Output: 1 1 2 3 1 2 7 1 2 1 1 1 1 3 1 1 10 1 2 1 2 3 4 7 1 2 1 2 3 13 24 1 2 1 4 1 1 3 4 1 2 7 1 1 2 1 16 1 2 1 4 1 6 1 2 1 1 58 1 2 3 1 5 1 1 1 2 1 6 1 1 2 10 1 1 1 3 4 1 1 2 19 1 21 1 1 1 3 5 1 7 1 2 3 4 12 1 2 1 1 3 6 1 1 3 1 5 1 2 52 1 2 1 1 3 4 1 2 3 1 1 1 7 1 1 10 1 2 1 2 1 1 7 8 1 1 2 3 1 1 7 1 9 1 1 3 1 1 2 1 35 1 1 1 2 4 6 7 8 1 1 1 1 5 6 1 1 2 10 11 1 13 1 2 59 66 1 2 1 4 1 2 1 2 5 1 2 3 1 2 3 4 5 9 1 2 1 1 2 1 4 17 18 1 2 3 1 28 1 1 2 32 33 1 2 3 4 1 1 1 4 9 1 1 2 13 1 1 49 1 1 1 2 1 1 7 1 2 1 2 5 1 1 2 9 1 11 1 2 1 2 1 24 1 26 1 2 1 4 1 2 1 4 5 1 2 8 1 2 1 4 13 1 2 3 1 1 2 7 8 1 102 1 2 1 4 1 6 7 1 1 2 1 1 2 14 1 2 1 1 5 1 2 1 4 10 1 2 1 4 1 2 1 1 1 4 1 1 1 3 1 12 1 1 1 2 4 1 2 8 1 10 1 2 155 1 2 1 2 1 1 5 8 1 2 1 1 5 1 15 1 1 1 1 2 4 1 6 8 1 1 3 1 14 1 2 1 4 1 2 21 1 1 3 195 1 2 1 4 1…

Example 2:

Input: 3134 585634135 644327962 105832164 8421324 999099978 539916597 763930546 9831336 118084011 469543101 859129741 602810120 414145085 536917263 285907165 869286832 992540375 326426920 855435865 819783425 615820704 714095889 720453850 511503706 513547873 42577238 804626857 503085889 921797386 828570929 453332209 423718064 469270704 485359094 501041166 62361349 855594123 204187883 164097785 576825545 55877167 106953332 520262191 32716064 568793179 974109799 922832910 633805014 48162212 592243694 405408712 775833633 187445521 230982817 21074859 461952699 184718245 815083787 802180623 801531659 590632072 849032644 490345170 563485489 502280110 667960465 32569668 247709242 490488741 372522449 571279089 781003432 831484843 890452878 340621789 482909093 306965272 687727747 200792135 726014391 347929…
Output: 1 2 1 1 5 1 2 1 2 3 6 1 1 2 1 11 12 1 2 1 1 2 3 1 2 1 7 1 12 1 1 1 3 4 5 1 8 1 1 3 1 2 3 1 5 29 1 1 1 2 1 5 1 2 1 4 1 11 1 1 1 15 1 2 1 4 1 2 3 1 5 10 11 27 1 2 1 4 1 6 1 2 1 1 38 1 1 2 3 1 6 7 8 1 2 1 1 5 1 15 1 2 1 2 1 1 2 4 7 1 9 10 1 1 1 70 1 2 3 1 2 3 1 2 9 1 2 3 1 2 3 1 2 9 1 1 1 4 14 1 2 1 1 5 1 2 3 1 2 1 7 13 1 2 39 1 2 1 1 1 2 1 2 1 4 1 9 1 53 1 2 1 1 2 1 5 1 2 1 2 10 1 1 1 4 1 170 1 2 1 2 1 6 1 2 1 4 1 2 3 4 9 16 1 2 189 1 2 1 1 2 4 1 1 2 1 4 1 1 7 1 1 10 16 1 1 2 1 5 6 1 2 27 1 1 2 4 32 1 1 2 4 1 2 1 4 1 6 1 1 3 4 1 6 1 8 9 1 1 3 1 5 1 1 3 9 1 2 1 2 1 2 5 1 1 1 2 1 31 38 1 1 1 279 1 1 2 1 1 5 6 1 1 1 1 3 13 298 1 2 3 4 1 2 1 2 1 4 11 1 1 2 4 1 6 1 8 1 1 1 1 5 6 1 8 1 29 1 2 1 4 5 1 2 1 1 5 1 2 3 14 1 1 1 4 5 1 2 51 1 2 1 4 1 2 7 1 1 10 1 1 2 1 15 1 1 2 1 2 6 1 2 1 2 11 1 28 1 1 …

Example 3:

Input: 653 875625211 253427667 471430951 725776273 402862898 642508817 771537597 242788128 216630074 407976554 914630985 96300460 725071424 140814401 800668956 787705541 634254481 699077606 476889373 927198593 710261385 129938237 598491105 429108619 444907387 158055476 329448293 464590731 537559235 981704741 893809190 824136013 872294900 933593444 413959864 488526261 133086582 464088337 608608596 454295004 478429826 707357456 541066069 975393877 31395299 693267767 255746388 343441008 475791429 810494707 134001379 422548040 303702638 103575444 96737903 263528991 24179907 234526289 530121446 555840065 2778955 144557427 318229961 842947268 343523039 37869174 959429183 96042798 603526328 698950282 4894723 70902896 794203103 577310843 249287733 389160845 212365550 834705388 984262906 917089633 5657342…
Output: 1 1 2 3 1 2 6 1 1 3 11 1 2 1 4 1 1 2 1 20 1 1 2 1 2 1 2 5 6 30 1 1 2 4 1 2 1 2 5 1 2 8 1 14 1 2 1 2 3 6 1 2 1 1 1 3 1 2 9 10 1 2 3 20 1 1 23 1 2 3 1 2 6 1 1 2 1 11 79 1 1 1 83 1 2 3 4 1 1 1 1 2 3 7 8 1 1 2 1 2 1 4 7 9 1 1 3 1 2 1 16 1 2 3 1 1 3 31 1 120 1 1 2 1 1 5 1 7 1 1 2 4 5 1 1 3 4 18 1 2 1 1 1 4 1 6 1 2 3 4 11 1 2 1 1 1 3 5 1 7 1 1 2 3 5 6 1 15 1 19 20 1 1 3 1 38 1 1 59 1 2 3 1 1 3 1 2 1 1 1 6 1 1 1 2 4 18 1 1 2 1 2 1 2 1 1 1 10 1 2 14 1 2 1 18 1 2 1 2 1 1 2 26 1 2 3 4 5 6 1 52 1 2 55 1 2 1 4 1 1 62 1 2 3 4 1 2 7 1 1 10 1 2 1 2 15 1 2 3 1 5 1 2 3 1 1 1 4 1 1 2 1 4 1 2 8 1 1 2 39 1 2 1 2 1 6 1 2 1 10 1 2 1 2 3 4 1 8 1 2 11 1 2 1 2 3 1 1 3 1 8 1 2 13 1 2 1 38 1 1 2 3 5 1 1 3 1 2 1 7 1 2 3 1 5 6 14 1 1 2 4 1 1 2 1 9 67 348 1 1 3 4 5 1 2 1 2 5 1 1 3 1 15 1 2 1 2 5 1 1 23 1 1 1 1 5 29 1 2…

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
Miller's signals Reckoning - MEDIUM Coding Problem | CodeTikki