CT47380

Lazy marks Streak Back

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Deep in the willow walks of Reedmarsh, Asha studies rows of marks 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: 2478 203776001 568561315 584852831 945445743 317213061 244894430 378148639 409457379 691199518 404553856 322739342 662434131 99608104 135302213 718480875 687193496 573383429 496121676 464732629 304494621 284029700 781888898 724161654 35854684 139618520 219503453 786632577 650973410 631282121 719902727 351055372 562292524 618528514 206275428 149840745 995067943 211087755 646158944 11960866 108732296 847809690 563729586 889814315 465375084 570896396 744890341 46088225 123182753 154465624 909462023 63289984 329032818 536676787 49505981 888754375 643563988 921871832 377512570 787954405 78640896 311382621 183328563 941442847 856928940 289494719 319425681 233257441 344654026 946466220 615383720 897873019 313655334 442184521 293604188 290769076 434241147 959090047 876892058 362089986 879251118 80…
Output: 1 2 3 4 1 1 3 4 5 1 1 3 1 2 11 1 1 1 1 1 1 18 1 1 2 3 23 1 1 3 1 2 3 1 1 36 1 2 1 2 5 1 7 1 2 3 1 2 3 14 1 2 3 1 5 1 21 1 2 1 2 1 27 1 1 2 1 4 33 1 2 1 2 1 1 3 41 1 1 3 1 1 1 3 1 50 1 1 3 1 2 1 2 1 1 7 1 2 1 14 1 2 1 4 5 1 1 3 1 1 1 2 13 1 1 3 1 1 2 20 1 1 3 4 1 1 1 2 5 1 1 1 1 2 15 1 1 18 1 2 1 1 2 3 1 1 7 1 9 10 1 2 15 1 2 1 71 1 2 3 1 5 6 78 1 1 3 1 2 1 1 3 6 1 2 1 13 1 1 3 1 1 3 1 2 3 10 1 1 2 3 5 1 1 2 1 2 5 1 1 1 2 16 1 2 1 2 5 6 1 1 2 1 1 28 1 2 3 32 1 1 3 1 2 3 7 1 1 3 1 1 2 46 1 2 1 2 3 1 5 6 1 8 1 2 13 1 248 1 1 3 1 2 6 1 1 2 1 4 12 1 1 2 4 5 1 1 3 1 2 1 1 3 6 1 2 1 10 1 2 3 1 1 24 1 1 1 4 1 6 1 1 9 1 2 3 1 2 15 1 2 1 4 1 2 3 4 1 1 3 1 5 6 15 16 1 1 2 1 21 1 2 1 1 65 1 2 3 1 1 2 1 5 1 2 1 2 1 1 12 13 1 1 19 1 1 2 1 2 3 1 1 28 1 2 1 1 5 1 2 1 2 3 1 1 1 9 1 2 1 2 112 1 1 3 1 2 3 1 …

Example 2:

Input: 3995 719706765 83617516 431450489 902550175 113098621 46457146 748485054 300457950 171276702 761807399 267639683 424166108 100529599 526465343 652297503 567884088 327910586 231729248 863831615 853185109 554433063 157065114 199221058 888408705 479129080 740228461 53566755 480938287 192628272 735872390 373049952 30005030 269564279 592095727 680141436 331760946 335427401 276833518 67226860 754775799 689993333 473454569 110664776 83246939 979199053 981529099 343557838 703205371 600621984 810190958 5781995 523393852 776476323 779339594 840199073 550439585 853948426 707528659 64381047 321998868 708589267 401078244 916751405 130164073 379450473 737764312 19747274 106661499 405448761 991905042 628713325 288688104 899884951 420838151 596544819 300886341 48817230 468972536 812156571 64898351 5584698…
Output: 1 1 2 4 1 1 3 1 1 6 1 2 1 4 5 1 1 1 15 1 1 1 2 20 1 2 1 2 1 4 1 1 2 4 5 1 2 1 1 16 1 1 1 1 45 46 1 2 1 4 1 2 3 4 9 1 11 1 1 2 4 1 17 1 2 3 1 2 3 70 1 1 3 1 2 1 1 3 6 1 2 3 1 2 1 2 3 6 16 20 21 1 2 24 1 1 2 4 1 2 1 1 1 4 1 2 1 4 1 10 1 12 1 2 1 1 2 20 1 1 2 3 1 1 1 1 2 6 35 1 1 2 1 4 1 6 7 1 9 1 47 1 2 3 1 1 2 7 1 1 151 1 2 1 2 3 6 1 1 2 3 11 1 1 3 1 2 3 1 5 1 2 3 1 13 1 15 1 1 1 3 1 1 3 7 8 10 1 2 1 4 1 2 1 8 9 10 1 22 1 1 3 1 1 3 1 5 208 1 2 1 2 3 4 7 1 2 1 11 1 2 1 1 5 6 7 1 2 1 1 23 1 2 3 1 1 6 1 1 2 3 1 2 3 1 9 1 1 1 4 5 1 16 1 2 25 1 2 3 1 30 1 2 1 2 35 1 2 1 1 5 1 42 1 2 1 4 1 1 1 4 1 2 3 4 9 1 1 2 1 2 1 20 1 2 3 4 5 91 1 2 3 1 5 1 1 8 9 1 2 1 1 1 3 4 6 1 2 9 112 1 2 3 1 5 1 2 1 1 5 1 7 1 2 1 2 5 1 19 1 2 1 4 1 25 1 2 3 1 1 1 4 1 2 1 4 1 10 1 2 1 4 1 1 7 1 2 1 2 5 1 1 1 2 1 5 1 20 1 …

Example 3:

Input: 1731 332774597 130659332 464788053 287066388 820184683 510295331 856824589 252333538 785067861 451084511 307433904 543527805 362177237 66774689 148606605 72663576 367949703 147727913 54669317 159567625 168808817 582453787 833060560 946812850 402617964 597557619 362085179 942999719 663340410 69626419 369049187 663270697 242926562 921486696 182129690 1801176 851800823 64594529 343339868 666660321 244583714 255705247 322296258 368282418 137888474 524870863 715907274 741712478 354392697 850720238 605568391 555360636 480043275 207854786 824348576 333347316 415059395 294672383 48538396 483224686 965199745 884278204 499256601 98880485 830531996 798918712 919257014 353303048 441879784 597816958 611630946 370272528 725266612 295981872 388191562 566532489 612290799 196229367 448939993 672944890 6990…
Output: 1 1 3 1 5 1 7 1 2 1 1 3 1 1 2 1 5 1 1 3 4 13 16 24 1 2 1 4 1 1 2 3 1 6 1 1 3 1 2 3 1 2 3 4 1 6 10 11 1 13 1 1 1 1 5 1 2 1 1 5 61 1 1 1 3 1 6 1 2 3 4 1 6 1 2 3 4 1 2 7 8 9 1 17 1 1 1 2 5 1 30 1 1 2 1 1 5 1 8 1 2 1 1 43 1 2 1 1 1 6 1 1 1 4 1 12 1 1 15 1 2 61 1 2 1 2 5 6 1 1 3 4 1 6 1 2 15 1 17 1 1 2 1 2 1 1 8 1 1 3 12 1 2 1 16 1 1 1 1 1 1 7 1 9 1 11 1 1 47 1 2 1 1 3 1 2 177 1 1 3 1 5 1 7 8 9 1 1 2 1 5 1 2 1 4 1 2 1 199 1 2 1 4 5 1 2 1 2 5 11 1 1 1 4 1 1 7 1 2 1 2 3 4 1 8 9 17 1 1 1 2 5 1 1 3 1 2 1 7 13 1 2 1 34 1 1 1 2 1 51 1 2 3 1 5 1 2 1 1 1 1 3 1 6 1 1 2 1 1 12 1 2 1 24 1 2 1 2 1 2 1 2 9 1 2 1 1 5 1 2 1 1 1 3 1 13 1 2 3 1 2 1 1 2 1 4 5 1 2 1 1 1 6 1 2 3 21 1 2 3 1 5 1 1 3 1 2 3 1 2 1 2 1 2 3 1 87 1 2 3 1 1 2 1 1 3 1 11 1 13 1 1 2 17 1 2 3 4 1 1 1 2 5 1 7 1 1 1 1 3 1 5 1 8 17 22 1 2 1 2 5 …

Constraints:

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

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