CT36465

Potter's signals Streak Back

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Potter inherited the ferry office at the savanna camp of Amberplain along with its curious bookkeeping system for signals. Time to make sense of it. 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: 1527 47676786 894371007 525840392 386268291 739008845 580467945 66148557 53606491 176023431 344869524 668576390 726042287 313519097 651630661 887551724 349452239 798700918 914007904 466301035 881531392 890568343 856061606 216106787 290924903 421442763 358486611 237205573 963415632 949730129 733762241 995948963 461379937 190689020 944854042 916351562 236836564 260015515 866582354 13374570 343308518 511826759 376252395 827967874 125258941 663638537 739085784 754110665 386050068 248718975 546415675 176176722 734939674 652283748 324863765 809526220 3884226 136619892 913438987 360516613 455438688 48790374 853340333 878112479 12970510 420543709 310590639 9988669 90235147 296292331 630873484 783761495 842064575 314218048 452712142 200369157 103939984 239690378 251828147 965424576 937619588 993155…
Output: 1 2 1 1 3 1 1 1 3 4 6 7 1 2 13 1 2 18 1 2 3 1 1 2 3 1 1 28 1 1 31 1 1 3 1 1 2 3 1 2 3 1 5 1 2 3 4 1 1 3 1 5 1 1 12 1 2 23 1 2 1 4 5 1 2 1 1 2 3 7 8 9 1 2 1 1 3 4 48 1 50 1 2 3 1 5 1 1 3 4 5 6 1 1 9 15 1 2 1 4 1 2 1 23 1 1 3 1 2 3 1 31 1 1 34 1 2 1 1 3 1 1 3 4 1 2 1 2 12 1 1 1 1 5 1 21 1 2 1 1 3 1 7 1 2 65 1 1 2 3 1 6 1 2 3 1 1 2 1 2 1 6 1 2 1 2 5 1 13 1 1 16 1 2 3 1 22 1 2 3 35 1 2 1 1 2 3 1 1 6 1 8 1 2 3 15 16 1 1 3 1 1 3 7 1 1 1 2 63 1 2 1 2 5 1 7 1 2 3 4 1 191 1 2 1 4 5 1 7 1 2 201 1 2 1 1 1 4 5 6 9 1 2 3 1 2 1 16 1 2 1 2 1 1 3 1 2 10 1 1 3 1 31 32 1 1 3 4 1 1 7 1 242 1 1 1 3 1 1 2 7 1 1 3 1 1 1 7 1 290 1 1 2 1 5 1 1 8 1 1 3 12 13 1 2 1 1 2 3 1 5 6 1 2 1 4 1 1 1 15 1 1 3 4 1 2 1 4 1 2 1 42 1 2 1 2 1 4 1 1 3 1 2 6 7 1 1 14 1 2 3 1 2 6 21 1 2 26 1 1 3 1 2 1 2 5 9 1 1 2 4 1 6 1 8 86 1 1 3 …

Example 2:

Input: 1417 243101500 564688490 709614569 649877029 61987211 976490926 695887595 80777068 119632604 154579900 696717368 203635376 828986577 878507188 358809459 701008370 354198507 544098631 259158532 308697181 275830286 653901200 693457570 745435410 179426395 884854389 20564863 899297228 129977102 812534292 294004350 740509338 39110360 153664571 505918013 719924640 755321578 472416965 492379951 967762132 548897344 539951771 779217202 58937442 326372137 924944715 836303021 753098946 569157759 154994051 865219423 268194655 374065693 242281992 7374166 287744992 517413075 434566812 852726316 305399070 559361737 60742763 562627904 75050011 632694904 235655420 173773924 363031788 790681423 810256030 275300189 22176246 408252145 52571661 404308749 372616983 732940806 27613943 25209634 928663560 11372192…
Output: 1 2 3 1 1 6 1 1 2 3 5 1 7 8 1 2 1 2 1 2 1 6 7 10 1 20 1 22 1 2 1 2 1 2 3 4 7 1 2 34 1 1 3 1 2 6 1 1 1 1 5 1 2 1 1 3 6 1 8 1 2 1 4 1 6 1 1 3 10 11 1 1 3 1 2 1 7 1 1 40 1 2 3 4 1 6 7 1 1 3 1 2 1 14 1 16 1 2 3 1 2 1 4 64 1 2 3 4 1 1 1 1 1 5 11 1 2 1 4 1 1 7 1 2 1 2 3 4 7 1 2 3 4 1 2 1 137 1 1 1 2 3 6 1 2 1 2 3 6 1 8 1 16 17 1 2 1 1 5 1 1 8 1 2 1 1 2 4 1 1 2 1 1 1 4 1 1 14 1 26 1 1 2 1 1 2 4 8 9 1 1 12 1 194 1 1 1 1 3 200 1 2 1 1 3 1 2 1 1 1 3 1 6 9 1 2 1 13 1 2 21 1 2 24 1 1 1 3 1 5 1 7 1 1 2 3 1 1 15 16 1 18 1 1 2 4 1 48 1 1 3 1 53 1 2 1 2 3 59 1 1 2 3 1 6 1 2 1 1 5 1 1 3 1 1 2 1 2 3 7 1 17 1 1 3 1 5 1 2 1 9 92 1 2 1 1 1 2 1 6 7 1 2 12 1 2 1 2 17 1 1 2 4 1 1 2 1 2 6 1 1 3 1 11 1 2 1 2 1 1 7 1 1 3 1 1 6 7 8 1 2 3 1 1 1 4 1 35 1 1 1 1 3 1 1 43 1 2 1 2 1 4 5 1 2 3 1 2 1 2 8 1 1 1 12 1 2 3 1 1 1…

Example 3:

Input: 1974 701862641 827524095 624753566 263387560 188433946 300306093 408533394 344273902 595409714 571381118 257925023 363423310 478831431 827526875 348174654 940183075 519511775 631946790 287852749 168111771 629880023 930745999 626403675 413243607 750645092 192238108 957080085 76803129 779782027 292328657 278916376 42541007 95901919 514695894 124229117 853560139 29460249 562564434 559134304 343627664 125744641 824253066 841322439 50711653 223568813 892572689 839479288 847544167 144622256 835373784 891335497 817694640 132579691 550033804 904869413 788087120 339958107 207504448 868098736 295765300 436802035 180251645 503449926 820344631 911967997 897339857 460628271 308784484 139542142 236054513 914088030 876717366 190786898 391073981 688843689 472818132 460995378 147113816 101133460 832425961 …
Output: 1 2 1 1 1 3 4 1 6 1 1 2 3 14 1 16 1 2 1 1 3 6 1 1 3 1 27 1 2 1 1 1 2 5 1 9 1 2 1 1 1 6 7 1 2 19 1 2 1 2 5 1 1 2 28 1 1 1 4 1 2 1 4 5 38 1 1 1 1 2 44 1 1 2 3 1 1 1 1 8 1 1 11 1 2 1 2 88 1 90 1 2 3 4 1 2 7 1 2 1 4 5 1 1 1 16 1 18 1 2 1 1 2 6 1 2 1 4 1 30 1 2 1 1 2 1 2 6 1 2 1 1 1 12 1 16 17 1 1 1 4 5 53 1 1 2 3 1 5 1 2 1 1 10 12 1 1 2 1 2 18 1 20 1 2 1 24 1 1 1 1 4 6 84 1 1 2 4 1 1 1 8 1 2 3 1 2 3 1 1 2 1 2 6 1 11 1 2 3 1 2 6 1 2 9 21 1 1 3 1 1 1 7 1 2 3 1 36 1 2 1 2 5 1 1 8 1 2 3 4 1 58 1 2 3 1 5 1 1 8 1 10 1 2 3 1 1 6 1 1 1 20 1 1 2 3 5 6 1 1 2 1 1 2 1 5 9 1 1 3 271 1 2 1 4 1 6 1 1 1 3 1 1 3 1 5 10 11 1 1 2 4 5 1 2 1 4 1 6 1 2 1 4 1 17 1 1 3 1 2 3 4 5 1 1 3 1 1 3 1 1 1 7 11 1 2 1 2 1 59 1 1 3 4 1 1 2 8 1 1 1 342 1 2 1 1 1 4 7 8 1 2 3 1 1 2 1 1 1 1 7 1 1 2 12 13 1 1 2 4 1 2 1 4 1 1 3 1 1 30…

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
Potter's signals Streak Back - MEDIUM Coding Problem | CodeTikki