CT38165

Kavya's Radiant signals

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

The quartermaster Kavya has been asked to file the annual report. On the desk lies a long table of signals 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: 550 618925696 726420276 58115434 319172948 707654304 656852718 489885381 558664459 61545572 895150008 846444223 478848069 139699804 411771671 790480125 741738890 551181110 848369147 656397731 470243921 917442863 475045300 714795978 68507337 103624112 103741769 936908370 513114874 427304999 9592333 424738139 842446551 919086852 519159705 572409230 783071649 756870803 590290444 578087006 617227927 160890074 89824826 20656387 64916610 765809562 729143663 382343179 377609894 234450064 921177342 546483962 484487444 370104206 546267237 60650871 360691079 635238165 33054933 429730372 616832425 382859173 208901691 561525979 709633150 353255054 483946582 438247243 148031767 278671423 739809486 59426624 522976503 775350683 281782664 175226939 326818375 746525344 856068307 947597325 824779657 1308546…
Output: 1 2 1 2 3 1 1 2 1 10 1 1 1 2 4 1 1 8 1 1 21 1 2 1 2 3 27 1 1 1 2 5 6 1 2 3 1 1 1 3 1 1 1 2 9 1 1 1 1 23 1 1 1 3 1 2 7 1 2 3 1 1 3 14 1 2 1 1 2 20 1 2 23 1 1 3 4 28 79 1 1 2 1 2 3 7 1 2 1 1 3 4 1 2 16 1 1 2 4 1 2 3 1 1 3 1 5 13 1 1 3 4 5 1 115 1 2 1 4 1 1 3 1 2 6 1 2 9 10 1 2 1 2 5 1 2 8 1 2 11 1 1 3 1 2 1 4 29 1 2 1 1 5 1 2 8 1 2 1 1 3 1 2 3 1 2 11 1 1 1 3 5 1 2 19 1 1 1 3 5 1 2 1 2 1 2 1 6 1 10 1 12 1 2 1 1 2 6 1 20 1 1 3 1 2 6 1 1 9 1 2 3 65 1 2 3 1 70 1 1 1 1 4 5 1 2 3 1 114 1 2 1 4 1 1 3 1 5 10 1 2 1 2 15 1 1 1 4 1 2 7 1 2 1 4 1 1 3 1 1 10 1 1 2 14 1 16 17 1 2 156 1 1 2 1 1 3 1 7 1 2 3 4 13 1 2 1 2 3 1 2 3 22 1 24 1 2 1 1 1 1 5 1 2 1 2 1 2 3 6 1 41 1 2 1 2 1 2 7 8 1 1 1 4 1 1 2 3 1 2 11 20 1 1 3 4 1 1 2 1 2 3 4 12 1 2 1 4 1 2 1 8 41 1 2 1 1 2 4 89 1 2 1 1 2 3 4 1 1 2 4 1 1 1 4 9 1 1 2 …

Example 2:

Input: 816 980362540 183837417 421363370 294412353 323692680 127244537 633071366 313597260 195933157 690307516 297947965 321111266 294872496 661930635 633378892 451615548 691343601 796377058 801892411 607375920 393216851 643950814 318718764 863976109 343406875 946858453 449339068 44641473 438584493 995284369 252885023 305869080 937891478 376404264 975278410 216252128 398279833 145083535 173888051 611129302 162871902 753989388 457560392 418293143 647613782 538967114 128425765 279481563 567111085 952640205 143042358 287327808 728556770 814381794 53866606 188406902 133044192 61944595 173653311 294847067 747724804 211459750 434763855 438578069 256781332 467757546 421855236 586004718 834020435 15180025 78178614 837775626 431307729 243105474 947497093 872032508 919160335 409544103 749750655 202705457 6…
Output: 1 1 2 1 2 1 6 1 1 9 1 2 1 4 1 1 16 17 18 1 1 3 1 23 1 25 1 1 2 30 1 2 3 1 5 1 2 1 2 5 1 7 1 1 3 1 1 2 4 15 1 2 3 4 1 2 1 1 3 6 7 1 2 3 1 5 1 7 19 1 2 22 1 1 25 1 2 1 2 1 2 1 2 5 1 9 1 2 1 2 3 4 58 1 2 3 1 2 1 65 1 2 1 2 5 1 1 1 9 1 1 3 4 1 1 7 1 2 3 1 12 1 2 1 2 17 1 1 2 1 4 1 33 1 1 1 4 5 1 1 8 1 10 1 1 1 1 15 1 2 1 2 1 1 1 1 3 1 11 1 2 132 1 1 1 2 5 1 2 1 1 3 1 12 1 2 15 1 2 3 4 5 6 7 1 9 1 1 3 13 1 1 3 1 2 6 1 2 1 2 1 4 5 1 2 1 9 12 13 1 2 50 1 2 1 2 5 1 1 1 4 1 1 2 1 5 65 1 1 2 3 1 2 3 7 1 9 1 2 1 1 5 1 16 17 1 1 1 1 2 6 7 1 1 1 4 5 1 2 1 2 1 2 1 1 2 1 16 1 2 1 4 5 6 1 8 1 2 1 1 5 6 7 16 285 1 1 2 3 5 1 2 1 1 10 1 1 3 1 1 2 1 1 1 7 1 2 23 1 1 1 3 5 6 1 2 1 2 5 1 1 2 1 16 1 2 3 1 2 3 7 1 1 1 50 1 1 1 4 1 6 1 2 1 2 3 6 348 1 2 1 2 1 2 3 4 1 8 9 1 1 1 1 14 15 1 1 2 19 1 2 3 23 1 1 3 29 1 …

Example 3:

Input: 365 403023850 436578676 670350475 661285349 805419424 363563864 996620333 449615424 120028019 766898528 237977116 678762395 196680594 151162286 46183890 832686246 644952911 294647675 534969027 346187794 941053735 619403016 586569558 316187972 126423344 384539658 717187957 935414940 934853022 571990533 770525779 609431002 557638866 813703252 319260852 708536612 236203080 237909207 593412402 611081299 469601713 414070210 427923500 496221047 875973527 772154972 989043205 716370155 188587809 530936408 414967196 616599860 721650517 114312661 128039414 702877677 338022529 930606611 132370581 678489514 665250893 146955305 373840640 724947839 812960158 196317940 966952581 415626972 357977050 293379174 598075345 704052041 344682508 923663911 950211186 490073405 880460706 122756371 874667468 9855500…
Output: 1 2 3 1 5 1 7 1 1 3 1 2 1 1 1 9 1 1 2 1 14 1 1 1 1 3 6 7 1 1 2 1 1 5 1 2 1 2 3 4 1 1 2 4 16 1 40 1 1 2 1 4 6 1 2 3 1 11 1 2 1 1 2 6 7 1 20 1 1 1 4 5 1 7 8 1 2 1 2 33 1 1 3 4 5 1 2 3 1 2 1 2 1 2 3 6 1 98 1 2 1 2 1 6 7 1 1 3 1 2 1 4 1 1 3 8 12 1 1 3 4 1 1 3 1 5 1 1 12 1 2 3 1 17 1 1 1 21 1 2 1 1 5 1 2 1 2 3 4 1 8 1 1 2 1 13 1 2 3 4 5 1 2 1 48 1 50 1 2 53 1 2 3 4 1 1 7 1 1 1 1 5 1 1 1 3 10 1 2 1 2 1 16 1 1 91 1 2 1 4 96 1 1 2 1 4 5 1 1 2 10 1 2 3 1 2 3 1 114 1 2 1 1 2 3 1 1 3 1 1 9 1 2 136 1 2 1 1 1 3 1 2 6 1 8 1 1 12 1 2 17 1 1 1 2 5 6 1 1 3 1 2 6 1 14 1 2 1 1 3 6 1 22 1 2 3 1 2 1 4 1 31 1 2 1 1 2 1 2 8 1 41 1 2 3 1 2 1 2 8 9 1 1 2 1 4 5 1 2 3 1 1 2 3 4 1 2 8 1 2 3 4 1 1 33 1 35 1 1 1 4 1 1 2 4 9 1 11 1 1 14 1 2 3 1 1 3 1 5 1 1 101 1 1 3 122 1 2 1 1 3 4 1 1 1

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
Kavya's Radiant signals - MEDIUM Coding Problem | CodeTikki