CT50467

Vesper's signals Streak Back

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Morning light hits the lotus ponds of Tranquil Basin as Vesper unrolls the day's manifest of signals. 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: 762 911675145 459733401 47492857 820069816 354095831 785490416 440002279 181137266 952885464 772482144 522505615 659014808 36686306 454763704 296676125 959654063 836335725 29029077 866592679 656027456 443211 263170990 563039314 163900392 33258177 948439457 76192794 92268039 397915953 180676994 616804913 203349982 476402410 94447067 434056814 927669503 957502724 995996201 385987864 341016518 840736241 850901622 819541617 290957266 401645540 285627282 374240042 52568357 609944648 484323178 790075555 603951003 257320310 726579603 642781301 254132524 912243263 812703031 778619298 847591706 854599385 376990098 240712236 454785923 416748090 809227654 557936204 428692092 360421200 481017226 76050227 430859113 125484097 354222399 44717262 888912083 731554717 607901245 888668974 819703075 374515413…
Output: 1 1 1 3 1 2 1 1 9 1 1 2 1 2 1 16 1 1 3 1 1 2 3 1 1 10 1 2 3 1 5 1 2 1 2 10 21 38 1 1 3 4 1 1 2 1 2 1 6 1 8 1 1 3 1 1 19 1 1 3 4 1 1 3 1 5 1 1 1 3 1 2 1 2 1 19 1 1 3 1 1 1 1 4 1 2 1 8 1 2 12 1 2 1 4 39 1 1 3 1 2 1 4 5 1 68 1 1 2 3 1 74 1 1 2 1 2 6 7 1 1 2 85 1 1 1 1 5 1 2 8 9 1 1 2 1 4 1 2 17 1 1 2 1 1 2 6 1 8 1 2 1 1 3 1 33 1 2 1 2 3 1 2 3 1 1 1 1 2 1 1 11 1 1 3 1 5 6 1 2 1 1 5 1 24 1 29 1 2 1 2 1 2 7 1 2 1 1 1 4 14 1 2 3 4 1 1 1 51 1 1 3 4 1 2 3 1 2 1 7 12 1 1 1 3 1 6 1 2 1 22 1 1 2 1 2 6 1 2 9 1 2 1 4 1 2 1 8 1 2 3 214 1 2 3 1 2 1 1 3 1 1 3 1 8 9 12 1 1 3 1 2 1 22 1 1 1 2 3 5 1 2 1 1 10 1 1 1 14 38 1 1 1 3 1 5 6 1 1 1 3 11 1 14 1 16 1 2 1 2 1 60 1 1 2 4 1 2 7 8 1 2 11 1 2 1 2 3 1 2 1 2 5 11 1 2 14 1 1 3 4 1 1 21 1 2 1 4 1 1 2 40 1 1 1 2 3 1 1 2 1 50 1 1 2 1 1 2 4 1 6 1 1 2 3 14 1 2 1 2 3…

Example 2:

Input: 391 186787170 861576753 624040768 358530463 908992101 73773112 554488798 838296384 696663822 902547723 793858675 537583806 938479359 831905205 453214382 552282601 207725628 761629283 202605492 230253466 74776700 613704282 577048739 484456829 978469153 29142587 788378856 61584212 647938659 888030896 118956781 373646018 121699907 658368447 786001110 182391786 352032599 408066284 122731478 201027531 81476912 921204783 186480241 54004945 115436294 340253448 83521177 361621276 237712608 686071306 119360310 492270100 375300527 330719966 533627596 263572523 92456066 413589315 159357450 58825231 873554897 666993084 872600976 974011440 587477768 832500758 92149484 259439063 498341610 303386120 931563817 626641358 246580492 97322755 665193205 413260117 39684014 842781884 431625432 110595102 61156744…
Output: 1 2 1 1 5 1 2 3 1 5 1 1 13 1 1 2 1 4 1 2 1 4 1 1 25 1 2 1 2 5 1 2 1 4 5 1 2 3 1 2 1 17 1 1 2 4 1 6 1 8 1 2 1 1 5 1 1 3 1 1 19 1 2 39 1 2 1 2 3 1 7 1 1 1 4 1 1 7 1 1 3 1 19 1 1 1 1 3 64 1 1 3 4 1 1 1 3 5 1 7 12 102 1 2 1 2 1 1 7 1 1 2 1 1 2 3 1 2 1 8 11 1 1 2 1 2 1 2 3 6 1 2 3 13 1 2 1 36 1 1 1 2 3 1 5 1 7 1 2 1 1 14 1 2 3 4 1 1 7 1 2 1 2 5 6 1 2 1 1 3 4 13 1 1 3 1 25 1 27 1 1 3 1 1 6 7 1 1 1 2 12 1 1 1 2 5 1 1 1 1 4 5 1 7 1 1 11 29 1 1 2 33 1 1 3 1 2 1 1 2 119 1 1 3 1 1 3 1 8 9 1 2 12 1 2 15 1 1 3 4 1 2 1 2 1 1 5 8 1 14 1 2 1 1 1 1 1 6 9 10 1 2 3 1 2 1 7 1 48 1 2 3 4 1 2 174 1 1 2 1 1 2 4 1 8 1 2 1 13 1 1 3 1 2 1 1 1 6 1 8 1 2 14 1 2 1 1 2 1 7 1 2 1 2 1 4 1 1 3 1 32 1 1 3 4 5 1 1 8 1 1 1 44 1 1 2 3 1 1 1 4 1 2 1 1 1 4 1 6 1 2 1 1 5 22 1 1 2 1 4 1 2 3 1 5 1 2 3 4 1 1 1 13 1 2 20 1 2 1 4 1 2…

Example 3:

Input: 2296 385198228 886544464 709933427 354385125 721181520 663870503 449731839 875069011 205847025 733421520 76791662 336549177 164173073 68557108 267393608 7757780 582120074 859313537 12596460 910290049 969476777 416822513 843019161 133030918 172378239 967412818 150440512 11413135 823406750 351978216 549929026 384365627 209374056 936148731 312944135 120450114 571408059 98922049 389796645 984844276 282577600 750641059 187898347 902851611 65370110 653841382 158646065 849197553 855525558 574240705 811634906 411760476 478130551 884475099 825879582 366473443 313960494 444924062 251771010 269182773 491609252 86477597 537325042 106979162 810933125 216755763 925752415 804773301 952468843 235239563 934607484 906723846 52575477 937641079 138179400 631251273 227010796 660206851 816287432 347999324 91537…
Output: 1 2 1 1 3 1 1 6 1 2 1 2 1 1 3 1 7 10 1 20 21 1 2 1 2 5 1 1 3 1 2 1 1 8 1 1 3 1 2 40 1 2 1 4 1 2 1 4 5 1 2 1 2 10 1 1 1 3 1 2 6 1 8 1 10 1 27 1 29 1 2 1 1 5 1 2 1 4 5 1 7 1 2 1 4 1 2 3 8 1 2 1 2 5 1 1 8 1 59 1 1 1 4 1 2 3 1 1 1 4 8 1 2 15 1 1 18 1 2 3 1 2 3 1 5 6 1 1 2 10 1 2 16 1 1 2 1 39 1 1 1 4 1 1 3 1 48 1 2 1 2 3 1 55 1 1 2 1 1 1 3 1 6 1 10 1 12 14 1 1 2 18 1 2 1 22 1 1 2 4 1 2 1 1 5 1 1 1 3 36 1 2 1 2 155 1 1 2 4 5 6 1 1 3 1 2 1 4 5 1 7 1 1 2 4 21 1 1 2 4 1 2 3 8 1 1 1 3 1 5 1 1 3 1 5 1 1 2 4 1 1 1 4 1 50 51 1 2 1 1 1 4 5 1 2 1 9 1 1 3 1 1 6 1 2 1 4 1 1 13 1 2 1 4 1 1 2 4 1 1 3 242 1 2 1 1 2 1 5 1 1 1 1 3 5 1 1 1 4 1 2 7 1 1 2 1 1 2 3 310 1 2 1 1 2 316 1 2 1 2 1 2 1 1 3 1 2 6 1 12 1 2 3 1 19 1 2 1 1 1 1 4 1 2 3 8 1 2 349 1 1 2 3 5 6 1 2 9 1 2 1 2 3 4 7 1 1 3 1 5 1 2 1 1 10 11 1 2 3 22…

Constraints:

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

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