CT51123

The Streak Back of Sleekwater

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Deep in the otter slides of Sleekwater, Sable studies rows of beacons 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: 2754 580699200 491710040 18554942 103321182 991781342 949226431 668746021 253556361 153267678 893139619 733337142 988622179 141595934 235512248 510282239 115965743 219044918 600129382 758666150 207255885 187484961 71018122 417806400 196324264 895970535 451226997 6952668 697863181 113343143 695203414 487588089 816077882 199706176 718117304 981644849 154837642 44656848 37102542 709493311 907600025 949796033 265260668 193734135 784499659 671823994 28402670 719796847 43737221 383711656 887331908 798081281 873341334 461268707 685228480 690130318 797509662 102434857 787219241 176830277 324290630 165538071 806977822 846807616 691355734 651093420 737738270 235216626 532696313 962593500 212218923 870483209 676140913 63927364 182494567 426298427 907395286 425818982 535817132 265199414 112155440 7282…
Output: 1 1 1 2 5 1 1 1 1 4 1 7 1 2 3 1 2 6 7 1 1 1 4 1 13 1 1 3 1 2 1 7 1 2 23 1 1 1 4 5 6 1 1 3 1 1 3 1 2 9 1 2 1 2 3 4 1 2 1 2 1 10 11 1 1 3 1 2 34 1 2 1 1 2 3 7 1 2 1 1 5 1 2 1 9 1 1 1 3 1 1 1 1 3 5 6 8 12 23 1 2 1 2 69 1 1 2 73 1 1 2 4 1 1 1 1 9 1 1 1 2 1 1 6 1 8 1 10 1 12 119 1 1 2 4 1 1 1 4 1 1 3 8 1 1 2 12 1 1 3 1 2 1 4 1 21 22 1 1 29 1 1 2 1 2 1 2 1 6 9 40 1 2 3 4 1 6 1 1 1 10 1 2 13 1 2 3 1 1 1 3 8 1 1 3 1 66 1 68 1 2 1 2 1 2 7 1 1 3 1 2 1 1 15 1 2 1 19 1 1 1 3 4 1 1 1 222 1 1 3 1 2 1 2 1 1 7 1 2 1 1 3 1 14 15 1 20 1 2 3 1 1 3 1 1 1 7 1 1 13 1 2 1 1 1 1 1 21 1 2 24 1 2 27 1 2 1 1 3 6 1 2 3 1 2 1 7 1 9 16 1 1 3 1 2 3 70 71 1 2 3 1 2 1 7 79 1 2 3 1 5 6 1 1 2 4 5 1 314 1 1 3 323 1 1 1 3 1 2 3 7 1 1 2 1 5 1 15 1 2 3 4 1 6 1 23 1 1 1 1 5 1 1 3 1 1 1 2 13 1 2 1 17 18 1 2 1 2 5 1 1 2 373 1 2 37…

Example 2:

Input: 442 415276436 233241726 224803005 528422141 412063916 433248214 419216983 528163547 170919500 27189362 793924132 688209410 317667610 716929225 473500965 834408515 730046359 214285924 361871333 748243035 189553277 621241858 400432834 661729373 806846161 825183429 320363008 672116172 414066640 318256859 984595846 471171555 654324936 79510237 229297860 517634217 439294605 31344042 290827608 560006571 125210090 991263566 31413931 932387051 299420091 640027054 542236304 85010602 394665521 221654034 492749100 84378392 783789240 397660136 965922471 646267930 859044342 524940294 722792966 447305586 300142501 60678036 851091171 376776615 136138739 445110374 456613185 441444759 458403185 289188098 423817341 871464011 238832394 986729756 365901129 360053806 14492496 955025046 919408874 45656813 48676…
Output: 1 1 1 4 1 2 1 4 1 1 11 1 1 3 1 16 1 1 2 4 1 2 1 4 9 10 1 2 1 1 31 1 2 1 2 3 1 1 2 7 1 42 1 2 1 2 1 1 2 1 4 1 9 1 13 1 2 1 2 1 1 1 6 1 1 3 4 1 6 1 2 17 1 32 1 1 1 4 1 1 2 1 4 1 1 1 2 9 1 1 3 1 14 1 1 17 1 1 20 1 2 1 2 3 1 1 8 1 1 1 12 1 1 3 1 2 6 1 40 1 2 1 2 1 4 1 1 7 10 1 1 2 1 4 1 2 59 1 2 3 4 1 2 3 4 1 2 1 4 5 1 2 1 1 81 1 1 3 159 1 2 1 2 3 4 7 1 2 1 2 1 2 3 8 1 2 1 2 1 2 3 16 1 25 1 2 3 1 5 31 1 2 3 1 1 3 1 1 1 4 1 6 1 11 1 13 1 1 1 1 2 1 4 1 6 1 2 1 4 12 15 1 2 3 4 1 34 1 2 1 1 2 1 1 3 77 1 1 3 1 2 1 1 1 6 1 2 1 2 14 1 2 1 2 5 1 1 3 4 1 2 3 1 2 3 16 1 1 3 20 1 1 3 24 1 1 2 4 1 1 1 3 1 1 2 1 1 5 6 7 1 9 1 11 21 1 2 1 140 1 2 1 1 1 1 4 1 1 10 1 2 1 4 5 1 2 1 2 1 11 1 2 3 1 2 3 1 2 3 4 5 1 7 1 2 1 1 3 1 1 2 7 1 1 2 1 48 1 1 3 1 2 1 7 1 2 58 1 1 2 1 5 1 1 3 1 1 1 4 1 2 7 8 1 76 1 1 2 1 4 …

Example 3:

Input: 2919 18911632 960099803 370223938 699666381 50445576 170707229 153668249 963719344 202338613 611693980 628829586 492457405 883030662 826872331 703794662 783984210 919086081 408475722 972945370 117427871 506478150 800271270 664289979 725272 398141663 57876999 214289975 847331819 51631106 877650256 292519603 508326076 32528818 136828082 227126592 838556710 242926790 816580093 456621108 45038241 817837012 867119785 669960850 24255781 118799246 563910283 506164292 345105317 609212672 666788034 951575731 605461464 749001554 280184650 209194355 507724285 558379736 625233478 36825991 637112885 457439008 898264311 748107452 666609316 111499177 49849883 728269107 17064270 850681713 965615639 956151467 713249748 161183367 993425814 936320349 633127129 86579532 719045581 362677328 842895474 832633907…
Output: 1 2 1 2 1 2 1 8 1 2 3 1 5 1 1 2 9 1 19 1 2 3 1 1 2 1 2 9 1 11 1 2 1 2 3 6 1 2 1 1 5 12 1 1 2 3 1 1 6 7 32 1 2 1 1 3 4 5 1 7 1 11 1 1 1 1 4 1 7 51 1 1 1 74 1 1 1 3 1 5 1 1 8 1 1 2 3 1 15 90 1 2 1 4 1 2 1 4 9 1 11 12 1 1 15 1 1 3 19 1 2 1 2 1 1 5 1 2 1 1 5 1 1 1 1 10 1 1 3 1 15 1 2 1 2 3 1 7 8 1 10 1 2 3 1 146 1 2 1 1 1 3 1 2 7 1 11 1 1 2 1 1 1 1 3 1 10 1 1 13 1 2 1 4 1 2 1 1 1 1 5 12 1 27 1 1 2 3 5 1 2 8 1 2 3 12 1 1 3 1 5 1 2 47 1 2 3 1 2 6 1 2 3 1 5 1 13 1 1 1 4 1 1 3 1 2 3 82 1 1 2 4 1 2 1 1 5 1 1 1 1 3 6 16 1 2 1 1 2 1 7 1 2 3 11 1 2 1 2 1 4 7 1 1 1 1 12 13 1 2 3 1 18 1 2 3 1 5 1 2 1 9 1 1 3 1 5 1 1 1 4 1 6 1 1 3 1 1 1 3 1 2 1 49 1 2 3 1 2 1 1 5 1 7 1 1 2 11 1 16 1 1 3 4 1 6 7 1 2 1 1 1 2 4 1 1 7 1 2 11 12 22 1 24 1 1 1 1 5 1 1 2 1 2 1 12 1 1 3 4 106 1 1 1 3 1 1 2 3 5 1 1 3 1 10 1 2 1 1…

Constraints:

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

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