CT43865

Curator and the Saffron marks

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

The valuer Curator has been asked to win the guild's seasonal contest. 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: 2308 955489695 583716078 864961885 913387807 749331059 885097181 664694227 863844852 88246002 930992928 869821857 231716120 477375646 606150537 675435 961395056 286083336 105556360 793266171 493953265 920084214 569926398 540886187 379585160 24339076 426013352 293819076 401313967 890871361 812839074 792533781 325356449 120451403 383490613 223684044 567729250 706249740 251614663 557863587 201978384 364344115 389091510 636661623 22948566 534598171 319516838 421289749 287653825 974954425 159806642 241741927 290524244 242402275 506220459 242971785 698243067 797462694 662563554 577962826 276711773 162002630 569531685 174004212 310571606 823393261 275844453 298609640 419827980 658021923 128747286 907076554 206842473 848751026 522726002 340047864 541320248 915408413 376004511 472175457 945005965 8…
Output: 1 1 2 3 1 2 1 2 1 9 1 1 2 3 1 16 1 1 3 1 5 1 1 1 1 3 1 2 8 1 1 1 1 3 1 5 6 1 2 1 2 3 6 1 2 1 2 1 49 1 2 3 1 5 1 7 8 1 1 1 1 3 1 2 16 1 2 3 4 1 22 1 2 1 1 3 28 1 2 31 1 1 1 3 36 86 1 1 1 3 1 2 1 1 3 1 2 1 1 2 1 10 16 1 1 2 1 1 1 3 1 5 7 10 1 2 3 118 1 2 1 1 5 1 1 3 1 2 1 12 1 2 1 2 3 1 7 20 1 1 3 1 2 1 1 1 9 1 2 3 1 2 3 1 1 1 10 1 1 2 3 1 5 1 1 1 3 10 1 13 1 1 3 1 2 6 7 1 1 10 1 2 3 1 5 1 7 1 71 1 2 3 1 5 1 2 3 1 10 82 1 1 2 1 2 1 89 1 2 3 1 1 6 1 2 1 4 1 2 220 1 1 3 1 2 6 1 8 1 2 3 12 1 1 1 1 3 1 7 1 9 1 1 24 1 1 1 2 3 4 7 1 1 3 1 1 1 3 5 6 1 2 1 1 1 4 1 8 1 1 51 1 1 2 1 4 1 6 1 1 1 3 1 64 1 1 2 1 2 3 1 8 9 1 1 12 1 1 3 1 2 6 1 1 2 4 5 6 13 1 1 3 1 5 1 2 1 9 1 1 1 4 5 6 1 2 1 4 1 2 3 1 1 2 4 1 1 2 1 16 1 2 3 1 1 3 1 1 3 7 8 132 1 2 3 1 5 6 1 1 9 1 2 3 1 5 1 1 17 150 1 152 1 1 1 2 4 1 2 7 1…

Example 2:

Input: 3597 286386532 715581123 789012644 635215391 623926443 19431695 872448873 772184203 207567665 709548255 694426119 31828422 777080894 121182731 920305999 72108175 228545860 55039567 120313076 303657104 390340285 161448659 652924830 412322329 780297232 930489726 967679673 185749287 921437296 944431804 291602358 23687325 594166666 203639713 2685170 992331250 754330391 809762490 682643178 982664159 283327291 496515049 492918435 999117183 65971177 23351665 696906069 468345022 463313782 748562893 415100283 860214147 392293442 243183728 502605457 372384399 456762820 308011420 160976610 745175447 207312553 100034818 224477137 285683499 647819584 958084109 642362108 21198724 698409580 300262662 48383025 135727205 594587873 354328770 699953160 423077756 259396020 525390506 367346888 949214674 541306…
Output: 1 2 3 1 1 1 7 1 1 2 1 1 6 1 15 1 2 1 2 5 6 1 8 1 10 26 27 1 2 3 1 1 3 1 1 36 1 2 1 4 1 2 1 44 1 1 3 1 1 6 1 8 1 1 3 1 2 1 1 8 1 1 3 4 5 22 1 1 3 1 1 2 4 1 9 1 1 3 1 14 1 2 1 2 1 2 5 8 1 1 2 1 13 1 2 1 1 1 4 5 1 7 23 1 2 1 1 3 29 1 2 3 1 1 1 2 8 9 1 1 2 1 4 1 6 1 1 1 85 1 1 1 3 1 5 1 1 1 3 5 1 7 1 2 3 4 1 1 7 1 1 2 18 1 2 1 2 3 1 2 1 7 1 2 3 13 1 1 1 1 41 1 2 1 2 1 1 1 8 1 1 2 4 5 1 7 1 9 18 1 1 2 1 2 5 6 1 2 3 4 72 1 1 3 1 1 6 7 1 2 1 1 12 1 1 2 4 1 1 3 8 1 2 1 2 3 1 2 3 4 1 9 1 1 2 1 1 17 1 2 1 4 1 1 2 1 9 1 48 1 1 1 4 5 1 7 56 1 2 3 4 1 2 3 1 1 2 7 1 2 1 1 12 1 1 2 1 4 1 2 7 8 10 11 1 1 1 3 4 1 6 1 32 1 2 3 4 1 1 171 1 1 2 4 1 6 1 1 1 3 11 1 1 3 1 2 3 1 2 6 1 1 3 24 1 2 1 199 1 2 3 4 1 2 1 2 1 2 5 12 1 2 15 1 1 1 1 2 6 1 2 1 10 1 2 13 1 1 3 4 1 2 35 36 1 2 1 4 1 6 1 1 1 2 5 1 7 1 1 3 1 2…

Example 3:

Input: 1544 200836922 206226698 166376434 731370002 490564076 35536875 653942088 59432235 148184235 307736282 208541734 398400984 777949377 964634553 202665129 332921672 719456710 785403974 259732997 429629265 446132491 303304687 538710024 557853603 215767485 134782248 53767934 593990419 690166122 832484242 796723535 982882313 608008893 359275618 72400570 647941657 372630903 176332117 775781156 32399310 147914198 109638489 693422206 391400780 767780284 645911453 524255217 173123898 597383786 635587029 924191671 333878061 279136532 2007486 780060382 828984938 649523145 934547595 138638543 513197006 889678258 330012431 737767390 392734242 427577840 508854706 648368964 500888556 154812818 76893702 715210171 758003665 253705531 151220765 215930759 749059679 578913329 724250900 892053498 34073307 9749…
Output: 1 2 1 4 1 1 3 1 2 3 1 5 13 14 1 2 3 4 1 2 3 1 5 6 1 1 1 10 11 16 1 32 1 1 1 4 1 1 7 1 2 1 4 1 6 1 1 1 3 4 19 1 1 1 4 5 1 26 1 2 3 1 2 1 2 3 4 1 1 1 8 11 1 1 2 4 1 2 21 1 49 1 2 1 2 3 1 2 1 2 3 1 2 1 1 5 1 1 2 4 1 16 1 2 3 1 21 25 1 29 1 1 2 3 5 1 1 1 2 4 1 41 1 2 1 2 3 4 1 1 3 1 11 1 1 3 1 2 1 7 1 1 2 1 1 13 25 1 2 3 4 1 2 1 2 1 1 3 1 7 1 1 1 1 5 19 86 1 1 1 3 4 1 2 7 1 1 97 1 2 3 1 2 1 2 5 1 2 3 1 2 3 12 1 1 3 1 1 1 4 5 9 1 26 1 2 1 4 1 2 1 212 1 1 2 3 1 1 2 7 1 1 3 1 2 13 15 1 2 3 1 1 21 1 1 1 3 1 6 1 1 2 31 1 2 3 1 1 1 1 1 1 5 1 2 1 1 15 1 1 1 1 2 3 6 1 8 1 11 12 1 2 1 2 1 6 1 35 1 1 1 1 1 3 7 1 2 1 289 1 1 2 1 5 1 2 1 1 2 4 1 13 1 1 2 1 2 1 6 1 1 1 1 3 1 13 1 16 1 2 3 1 2 1 4 1 6 1 2 3 331 1 2 3 4 1 2 1 2 5 1 2 1 1 3 1 1 1 3 10 16 1 2 3 1 1 22 27 1 1 3 1 1 3 1 5 1 1 38 1 2 3 4 1 1 1 4 …

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
Curator and the Saffron marks - MEDIUM Coding Problem | CodeTikki