CT49998

Alaric Counts the marks

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

The quartermaster Alaric has been asked to file the annual report. On the desk lies a long table of marks readings. 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: 2970 869619266 640252478 129232539 821039314 414240936 810884358 51684555 473857709 29633907 125115779 834432132 716508265 330338716 908869122 224661342 997257928 527496314 202883274 219115105 974732170 826604508 577013971 843960040 776243048 482412478 699373784 730966479 842786322 953511211 851039430 795735883 507693483 643549406 214520262 882053137 61686692 18658103 35933885 834893590 691508272 816495877 220334128 510937535 855270905 179305633 508165994 776581694 395033803 809771339 187979924 57785648 826533551 529469629 573603517 840765868 391382658 898764865 361032152 936492634 686290526 496024067 809271519 728887969 765370875 108978947 378339287 144943562 602734390 62867974 537397068 553223473 268306183 709631745 70040392 295757889 818433113 562302521 795512900 332146598 559760739 170…
Output: 1 1 1 3 1 2 1 2 1 2 10 1 1 14 1 16 1 1 2 4 1 1 3 1 1 2 3 5 9 1 1 1 2 1 6 1 1 2 4 1 2 1 2 9 1 2 3 1 5 1 1 8 1 2 11 1 28 1 30 1 1 3 1 2 1 2 1 4 1 2 3 1 9 1 2 17 1 2 1 2 1 2 5 1 56 1 1 1 1 1 1 4 8 9 1 2 3 1 2 80 1 2 1 4 1 6 7 1 1 2 1 2 3 1 2 8 10 1 2 3 1 2 1 1 1 19 1 2 113 1 1 1 4 5 6 1 2 9 1 1 2 3 1 2 3 1 2 1 1 1 3 1 1 3 10 1 12 1 20 1 1 1 1 4 1 6 1 2 1 1 33 1 2 3 1 1 6 1 1 1 2 1 4 1 2 1 9 1 12 1 1 21 1 2 3 1 2 6 1 2 1 1 2 1 5 1 2 1 1 1 4 1 15 1 1 2 1 4 1 2 8 1 2 3 1 97 1 2 1 1 1 2 4 1 9 1 11 12 1 2 3 1 5 1 1 2 1 2 5 6 25 1 1 3 4 1 1 1 8 1 1 2 4 1 2 250 1 2 3 1 2 6 1 2 1 2 1 4 1 2 7 1 9 1 1 3 1 2 17 1 2 20 1 2 1 30 1 1 3 1 2 3 7 1 9 1 11 1 1 2 1 5 1 7 1 1 3 1 2 1 55 1 2 1 1 1 6 7 1 2 3 1 2 13 1 1 16 1 2 1 2 1 6 1 1 2 1 5 1 7 1 2 1 11 12 19 1 2 38 1 2 3 4 5 1 2 3 4 1 2 7 1 2 1 4 12 1 1 3 1 5 …

Example 2:

Input: 1889 387108960 897541100 613501269 443031247 168421068 715102366 52463352 749622364 377984160 988791408 903081022 204428987 189877395 327707360 506550508 231970464 110114762 51738713 704148472 443883585 441564657 486217003 391538716 832403380 336615338 593349148 585408128 763177691 398055611 728911793 565701389 181201335 74189776 674184609 921204920 634164725 75898185 272600373 994241465 82850243 238223158 321439381 584110482 899989622 130876056 939992866 469969466 318511059 942275492 532410298 899947071 768713320 568498956 341058732 766584757 203508036 275497272 947521318 350626135 23013081 271969020 46204718 361309353 25327994 26508230 404825688 197126084 933609764 474773274 236234496 650552683 981500573 691022990 857171766 470908943 893857152 294148777 447442097 801245729 389523416 2534…
Output: 1 2 1 1 1 4 1 6 1 10 1 1 1 3 4 1 1 1 8 1 1 3 1 13 1 2 1 4 1 2 1 1 1 4 25 1 1 2 39 1 2 3 4 5 1 7 1 1 10 1 2 1 1 1 3 1 2 19 1 1 2 1 5 1 2 8 1 10 1 1 3 33 1 2 1 4 1 2 3 1 1 3 1 2 3 1 11 1 1 1 2 1 5 6 1 57 1 2 1 4 1 1 3 1 2 10 1 2 1 1 5 6 1 8 1 2 3 12 1 2 3 16 17 1 1 2 3 1 1 7 1 9 10 1 1 1 2 1 139 1 1 2 1 1 2 4 1 2 1 4 1 1 13 1 1 2 3 1 2 7 1 1 1 3 5 1 2 1 1 31 1 1 2 3 5 1 1 3 1 1 6 1 1 1 10 1 1 3 1 2 3 4 1 1 3 1 2 3 4 12 1 2 1 2 3 31 1 1 3 1 2 1 4 1 2 3 1 12 1 1 3 1 2 6 1 2 3 1 5 1 1 2 1 2 1 2 1 1 10 11 23 1 1 1 3 1 6 1 2 3 1 2 1 1 3 1 1 17 1 1 3 4 5 1 2 1 49 1 1 1 1 5 1 104 1 1 3 1 2 1 7 1 1 3 1 5 1 1 1 2 4 1 2 1 9 1 2 1 18 1 2 1 1 1 1 2 3 1 1 7 8 1 1 2 1 4 6 1 17 1 40 1 1 1 1 5 1 1 1 4 5 1 1 13 1 1 3 1 2 1 1 3 22 1 71 1 1 1 3 1 1 1 2 1 2 1 1 13 1 2 3 1 2 6 1 2 3 10 95 1 2 1 4 1 2 1 1 1 1 4 5…

Example 3:

Input: 2162 214181119 99182145 14520773 790219085 887585103 861424905 187988052 372717753 944891846 163446874 521607693 618899154 852215396 807643029 654212278 750370098 120008199 186823982 722076646 797453991 593944734 198785526 387672306 517402539 249719184 397249427 418821359 311221606 97019102 271395202 987614243 134998241 243377641 315565305 362183543 832340376 486311033 520681250 677184670 95645550 650866335 863161427 536225357 870828781 383300801 340262343 986996887 475535004 111687432 447728947 944127929 744225124 85113744 810891104 124933471 357236469 360308097 644997050 473305814 490741414 738255759 719718472 919804047 246089055 662335114 144104631 634103544 635412813 496989268 537799918 796474757 714616034 539315528 340563205 725105062 814221631 484804611 222786969 162151296 23246288 8…
Output: 1 1 1 4 5 1 1 2 9 1 2 3 4 1 1 2 1 2 3 6 1 1 2 3 1 2 3 1 1 2 31 1 2 3 4 5 1 2 3 1 2 11 1 13 1 1 16 1 1 2 4 1 1 3 1 2 3 4 1 2 7 1 12 1 2 1 2 3 1 2 8 1 1 1 4 13 1 1 1 1 18 1 1 3 22 1 2 3 1 1 3 1 8 1 2 1 1 5 6 1 16 1 1 41 1 1 3 1 2 1 2 3 6 1 64 1 2 71 1 1 2 1 2 5 1 1 1 4 1 6 7 1 2 3 1 1 19 1 1 2 3 1 2 3 4 8 1 2 1 2 1 2 3 1 2 1 4 12 1 1 3 1 2 3 1 2 1 7 1 1 13 1 1 3 1 5 1 2 21 1 43 1 2 1 4 5 1 50 1 1 3 1 1 3 1 1 1 2 5 1 64 1 2 3 4 1 160 1 2 3 4 1 2 1 1 5 6 1 1 1 10 11 12 1 14 1 1 17 1 23 24 1 26 1 2 3 1 5 6 1 2 1 4 1 6 1 2 1 4 5 1 2 1 1 10 1 1 3 1 1 3 7 1 2 1 1 2 35 1 1 3 1 5 1 7 1 1 2 3 4 6 1 1 2 1 11 1 2 3 1 2 3 7 1 1 2 4 1 1 32 1 302 1 2 3 1 2 3 7 1 2 1 2 5 1 2 15 1 1 1 2 1 2 7 1 2 1 11 12 1 14 1 2 1 4 1 20 1 1 1 3 4 1 2 1 1 1 2 4 6 351 1 2 1 2 3 6 1 2 1 1 2 6 1 2 1 1 5 6 1 2 1 2 1 18 1 2 1 1…

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.