CT40325

The Streak Back of Balmcrest

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

It is audit day at the cedar groves of Balmcrest. Piper spreads the beacons records across the table and picks up a sharp pencil. 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: 1590 152826984 773323793 409511229 97529145 300302572 563319014 63435020 150838463 571088026 478580944 516575856 369310221 34819083 379880707 128932798 468250003 599561668 718790553 852173917 105607138 371393717 731978318 919212452 587990026 200497022 415992706 514601936 409067386 515355435 355785721 264016766 235694982 292056322 110865969 736108476 828731536 323650604 272194079 886637623 284384668 613337682 199797223 960984391 806856933 109154119 602441670 906727626 260083181 695604195 69965083 831897812 289415466 830026728 455514991 580675350 741981280 490520655 682119711 42691622 914195475 105446075 236410697 408883029 402278657 61031729 675361032 790876104 591465134 996578764 195344388 276459695 469836409 611897066 384998666 877069629 568425172 744493745 307990379 813186691 994366271 9…
Output: 1 2 1 1 2 4 1 2 7 1 2 1 1 3 1 5 15 16 19 1 2 3 23 1 1 2 3 1 5 1 1 1 3 1 12 13 1 1 16 1 2 1 43 1 1 2 4 1 2 1 4 1 2 1 2 3 1 2 1 17 1 2 3 1 1 6 7 1 69 1 2 3 4 1 6 1 2 1 4 11 1 2 1 4 1 1 3 4 5 1 1 2 3 10 1 1 17 1 1 2 1 1 1 7 1 26 1 2 1 1 5 1 1 1 1 3 11 1 2 3 1 1 3 1 5 6 10 1 12 1 1 3 1 1 2 3 4 5 7 1 2 3 1 144 1 1 3 1 5 1 2 1 9 1 2 3 1 1 1 3 1 18 1 2 1 1 1 24 1 1 3 1 1 3 1 1 1 1 2 1 4 1 7 1 2 1 2 1 21 1 1 3 4 1 1 3 1 5 1 2 1 1 3 4 1 17 1 2 1 1 2 3 4 1 6 7 9 1 2 1 2 1 4 5 8 1 2 3 1 1 6 24 1 1 1 2 29 1 1 3 1 1 6 1 1 3 1 2 12 1 83 1 2 1 2 1 4 1 1 2 1 2 5 7 1 2 10 11 1 19 1 1 2 1 4 1 2 3 1 1 2 1 8 13 1 2 3 4 1 6 1 2 1 10 1 2 1 4 1 132 1 1 1 2 1 6 1 2 9 1 2 1 2 1 1 7 1 2 1 2 3 4 1 1 2 1 1 2 7 1 9 1 11 1 1 20 1 38 1 2 1 1 43 1 2 1 4 5 6 1 1 2 3 5 1 1 3 1 1 3 7 1 2 21 1 1 3 1 5 1 1 8 1 2 1 12 1 2 3 1 …

Example 2:

Input: 3853 156272570 976321257 200473301 383058537 521814212 557149277 86673704 594082096 37134238 938584662 995917797 645534458 392596085 526219040 249524711 226226939 861123872 896272448 464192735 703489325 231572228 691060301 488442222 406398251 177741839 865413082 344502701 401286995 638242982 193193002 757247187 56782719 414397864 992036097 472979832 547303858 689920376 639110434 845775976 500249299 412764790 55585417 727558136 714549366 673956878 733948657 916659054 822978863 493925686 438979867 129040482 213712593 690031772 23212768 432735711 697221776 906543551 26756111 84759171 64069416 397087323 42011046 657920990 25726993 575762359 570362532 292426092 739540957 352597559 114799235 368356584 188431244 411682370 332532168 721991134 238795030 545584217 466969670 712242565 368135385 19793…
Output: 1 2 1 2 3 4 1 6 1 8 11 1 1 2 1 1 6 7 1 2 1 2 1 1 1 8 1 2 3 1 5 1 2 23 1 2 3 1 5 1 1 1 4 1 1 7 13 1 1 1 1 2 5 1 2 8 10 1 2 1 4 1 6 1 2 1 1 11 1 1 3 1 5 1 7 1 2 1 4 1 1 2 1 1 5 29 1 1 1 1 2 5 1 2 8 62 1 2 3 1 2 1 1 70 1 2 1 2 3 1 2 1 9 1 1 1 1 2 15 1 1 2 3 1 2 1 1 1 2 7 1 2 3 1 16 1 2 3 4 1 2 1 2 1 26 1 28 1 2 3 1 2 6 1 1 2 4 1 1 1 1 1 6 17 1 2 1 21 1 1 52 1 2 1 2 5 6 1 1 3 1 5 1 1 3 4 5 1 2 1 1 2 1 2 18 1 2 3 1 5 1 1 1 1 4 6 1 1 3 4 5 6 1 2 9 1 1 12 1 1 21 1 1 24 1 2 1 1 2 1 36 1 2 1 1 3 4 1 2 3 1 1 3 49 1 2 1 71 1 2 3 1 5 243 1 1 1 4 1 6 7 1 2 1 1 1 6 1 2 3 17 1 1 2 3 1 1 2 25 1 2 3 1 5 6 1 2 1 2 1 2 1 2 15 1 2 1 1 2 3 4 6 1 2 3 1 1 3 1 5 6 1 2 3 13 1 2 24 1 1 3 4 1 2 7 8 1 1 35 51 1 332 1 2 3 1 2 6 1 2 3 10 1 2 3 1 1 6 1 2 1 1 2 1 7 14 1 1 3 1 1 1 1 2 1 2 3 6 1 1 15 1 1 1 1 4 1 2 1 9 1 40…

Example 3:

Input: 3462 44171173 43396371 304395170 892500713 82743223 862058175 600919120 632560625 760346571 19074974 703470414 438386722 772600514 500736169 554846795 231382911 895255938 851893377 363627640 902232900 104399465 729357793 37393375 461839735 457061856 46398296 417036110 273412797 362992025 884066217 283175355 425957677 379489979 374270731 171800150 971302560 971729119 139768630 915198458 152469661 699927322 609639318 461614123 960317714 619941845 56291648 987528184 386815187 753103837 717742119 117639209 508123577 201506253 380888827 448573740 31652181 508343867 242527049 475632773 666289229 273137316 236221301 469769610 761309699 173586184 816784432 882445175 86980422 856746966 980318722 400424739 416130999 243355193 185739583 345666012 775395065 899681315 310832306 208177541 776505723 4261…
Output: 1 1 3 4 1 2 1 2 3 1 2 1 7 1 2 1 17 1 1 20 1 2 1 2 1 1 2 1 2 10 1 2 1 1 1 36 37 1 2 1 2 1 1 7 1 1 47 1 2 1 1 2 1 2 3 1 7 1 2 10 1 1 3 17 1 19 20 1 2 23 1 2 1 1 3 6 7 1 1 3 1 5 13 1 2 16 1 1 3 1 5 1 1 2 3 1 5 1 7 9 1 2 3 1 2 15 1 2 1 2 25 1 43 1 1 1 1 4 5 1 8 1 2 11 1 2 1 2 1 2 7 132 1 2 3 4 1 1 7 1 1 2 1 2 1 4 1 9 1 11 1 20 1 1 3 1 2 1 1 2 1 4 1 6 1 1 2 3 12 1 2 15 21 1 1 1 1 2 3 1 2 8 1 2 12 1 2 1 2 58 1 1 3 1 2 3 1 1 6 1 1 9 1 2 1 1 5 1 2 3 1 1 2 4 1 1 3 11 1 1 1 4 1 2 35 1 2 1 2 40 1 2 1 1 1 2 3 4 6 1 1 3 10 1 15 1 1 3 4 1 6 1 1 3 65 1 1 2 3 1 2 1 7 1 2 3 4 5 1 2 15 1 1 2 1 1 2 6 1 8 1 2 1 4 1 2 1 2 18 1 1 3 22 1 2 1 1 27 1 2 1 1 3 1 5 1 1 10 53 1 1 3 4 5 1 2 1 1 5 1 2 1 14 1 2 1 2 5 6 1 8 1 2 11 1 2 1 15 1 1 3 4 1 1 1 4 1 2 1 1 3 1 30 1 2 101 1 2 1 228 1 1 363 1 2 3 1 1 2 1 1 1 6 7 1 9 …

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
The Streak Back of Balmcrest - MEDIUM Coding Problem | CodeTikki