CT40679

The Streak Back Beneath Sleekwater

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

The council of the otter slides of Sleekwater pays by the answer, and Tailor intends to earn it. First: the full register of marks. 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: 499 918175705 331915745 716246241 902659783 575416694 527562574 728302583 67521129 662100715 406019054 524814889 103492766 728624256 2009959 179781061 23517991 526516779 267230708 251314710 842204390 964983071 953585263 966571242 985884390 846942572 347907818 776450922 474663764 137334781 227577754 717861123 247252780 943762192 531542401 188953480 443806705 642841455 465077715 95704672 38768482 910156113 455624407 231952977 189607435 713469548 631079475 206135836 187396261 403294905 644397140 735474888 353106220 37586870 620324418 453367726 979387310 881309910 813375126 12811047 504342797 684547551 954765462 600698322 495760488 559027549 566532712 54082197 274184296 647815354 315337057 355771862 305655730 221014819 623599420 810627535 444810095 396708503 261456534 635215886 99292986 598475…
Output: 1 1 2 3 1 1 3 1 2 1 2 1 9 1 2 1 4 1 1 16 21 1 23 24 1 1 2 1 1 2 4 1 9 1 1 2 4 1 1 1 8 1 1 1 4 1 1 1 3 5 10 1 1 3 1 32 1 1 1 2 3 6 1 1 2 3 1 2 7 1 2 1 1 5 13 1 1 1 4 1 2 1 2 1 1 11 1 1 27 1 29 1 2 1 4 1 1 1 4 5 1 1 1 2 5 1 7 52 1 2 1 1 2 4 1 1 3 4 1 10 11 1 1 2 1 5 1 1 19 1 2 1 1 1 111 1 2 1 2 1 4 1 6 1 2 1 1 11 1 2 1 2 18 1 1 1 2 4 1 2 7 9 1 1 30 1 2 1 4 1 6 1 1 2 1 1 2 7 44 1 2 1 159 1 1 3 1 5 1 1 3 1 1 3 1 1 9 1 11 1 1 3 15 1 1 2 1 1 6 1 2 1 1 3 27 1 2 3 1 1 3 1 1 1 42 1 1 2 4 1 6 7 1 1 3 53 1 2 1 4 5 59 1 1 1 1 2 4 6 1 8 69 1 2 1 2 5 1 2 3 1 1 1 81 1 1 1 3 1 6 7 1 249 1 2 1 2 5 1 2 1 4 5 1 1 1 4 10 11 1 2 1 15 1 295 1 2 1 1 5 1 7 1 1 3 1 2 1 2 3 1 5 1 2 1 11 1 1 1 1 1 27 1 1 1 3 1 2 1 4 9 1 2 1 4 14 1 2 1 4 1 2 7 1 2 3 1 12 1 2 1 4 5 1 2 1 4 1 2 38 1 2 1 2 5 1 1 3 9 1 1 3 13 1 2 1 2 1 1…

Example 2:

Input: 991 394784928 525691873 117643497 643786679 552745276 258653232 10886388 373317447 835372563 114273894 400464637 35273476 487803395 251161523 227682357 446946318 226638521 631126089 438104106 335820223 494622515 366898492 818088251 122035083 587913125 573661710 484462583 519143557 725485797 891924975 434565609 95966227 731917792 411789257 59972409 114568071 610518520 298782477 358711794 838045699 158660072 619052470 724014020 331726390 876390243 128690969 163546041 647149234 77133492 735340765 731046574 988369914 731333777 230211928 625369861 671850964 707507900 687694562 879875187 3424219 139795844 430499417 704052022 741555730 524599360 398046811 108042219 786034111 137152658 606312304 913031149 792806390 608346035 557916351 497855934 91916705 516839907 178336675 572001162 954862182 5164…
Output: 1 2 1 4 1 1 1 3 9 1 2 1 4 1 1 3 1 9 1 1 3 1 14 1 2 1 1 2 6 30 1 1 3 1 1 2 4 1 2 10 1 2 3 1 15 1 2 3 1 5 1 52 1 1 2 3 4 1 7 1 2 3 4 5 1 1 1 9 1 2 19 1 1 1 1 1 3 1 6 28 1 2 3 1 2 6 1 2 1 2 3 1 5 1 2 16 1 2 1 4 1 1 2 3 9 1 2 1 29 1 2 1 1 3 1 2 8 1 2 3 1 1 1 2 8 1 1 1 3 1 1 3 53 1 2 1 1 86 1 2 1 2 5 1 7 8 1 1 2 3 4 14 1 1 155 1 1 1 2 1 2 3 6 1 2 3 1 2 1 1 5 1 17 1 2 3 4 1 2 1 8 9 1 2 1 1 3 1 5 1 7 19 1 2 1 4 1 6 1 2 3 1 1 3 4 14 1 1 1 37 38 1 1 3 1 60 1 2 3 1 2 6 1 1 3 1 5 6 1 1 1 3 1 6 1 8 9 1 11 24 1 1 3 4 1 2 3 1 94 1 1 3 1 1 3 1 102 1 2 3 1 2 3 1 2 9 1 2 1 2 1 2 16 1 1 3 1 2 1 2 5 1 1 1 2 5 14 1 2 3 1 2 6 1 2 1 24 1 1 2 28 1 2 3 1 5 1 2 3 9 1 2 1 1 5 1 2 1 2 1 2 1 6 1 1 1 70 1 1 3 1 2 1 4 1 1 7 1 2 1 2 3 4 7 1 1 3 4 5 6 7 25 1 1 2 4 1 31 1 1 1 2 3 4 7 1 1 3 1 2 13 1 2 1 2 18 1 2 1 2 5 1 1 …

Example 3:

Input: 3466 715957681 520254341 942502795 614978034 655718829 817531853 23514083 190386183 610559718 176198459 809965994 543255928 418343740 931753841 283166651 963352817 879640071 688647823 879943429 880733609 946361326 713975244 588520515 191666807 857846471 143728730 665893696 783740570 855625420 363676110 502820900 471486626 944097787 731449327 337545072 792436263 355440173 89343507 862717384 367831636 114513676 653831443 412578854 370113297 32090609 75913633 715708382 399698603 159121860 231401942 108428914 783673425 502499516 813243485 854786760 414136937 214003346 468335582 831710947 327030861 211517137 12327819 38069938 339101352 939782176 631780197 495311476 730782778 851951923 323127917 309836448 307611782 775215473 819804919 444707753 808186647 268140903 75132713 952779826 511708978 92…
Output: 1 1 3 1 2 3 1 2 3 1 5 1 1 11 1 16 1 1 3 4 5 1 1 1 4 1 2 3 4 1 2 1 12 1 1 3 1 1 6 1 1 3 1 1 1 2 8 1 1 2 1 13 1 15 16 1 1 3 4 1 1 1 2 5 32 1 1 3 4 1 1 1 4 5 1 2 1 1 63 1 2 1 2 3 4 1 1 2 1 2 3 7 12 1 14 1 1 1 2 1 5 7 1 9 1 2 1 1 28 1 2 3 1 5 1 2 1 2 5 1 42 1 1 2 1 2 5 7 1 2 3 1 2 1 1 5 1 7 1 1 10 1 2 65 1 2 3 1 1 1 7 8 1 1 2 1 5 1 7 1 2 10 19 1 2 1 4 1 2 1 4 1 2 11 31 1 2 34 1 36 1 1 3 4 1 2 187 1 2 1 2 1 4 1 2 3 4 1 1 3 1 5 6 1 1 3 1 1 1 3 1 1 7 1 1 2 4 1 219 1 2 1 1 3 4 1 1 2 1 2 3 11 1 1 1 2 18 1 1 3 1 23 1 2 3 1 1 6 1 2 1 1 5 1 2 1 9 1 2 3 1 2 1 2 1 6 7 26 1 2 3 1 2 1 7 57 1 2 1 2 1 1 3 6 1 2 1 1 5 1 1 14 1 1 295 1 2 3 1 2 3 1 8 1 2 3 1 1 3 1 1 17 1 2 1 1 22 1 2 3 1 2 1 1 5 6 1 1 9 1 2 1 1 1 18 1 42 1 1 1 2 4 1 2 7 1 9 1 1 13 1 1 2 4 1 6 1 1 3 1 1 3 1 2 6 1 2 73 1 2 1 2 1 6 1 2 9 1 1 2 38…

Constraints:

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

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