CT39706

Last ledgers of Kavi

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Legend says the vault under the ivory gates of Alabast opens only for a perfect tally of ledgers. Kavi means to find out. 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: 1188 822571794 669300502 506455871 42789398 431762798 377915689 166885454 952996787 612329450 602442759 30949800 118695273 525596070 221706604 786837733 768906103 411091946 731683953 148522179 684112289 648366215 924580962 355017667 808781388 835817959 272131449 162866011 302287713 193873668 12783720 80788686 115364717 241343963 669780730 926696085 336650331 270183013 382338069 784034773 664561373 674258850 313418448 157552549 45247767 943996180 862050660 444259380 322298273 347781345 815844617 571830145 204408010 406248835 726026113 992170894 441305255 854954810 622749245 613700992 387482577 438531118 702960151 45094108 905777857 531364964 648264540 917926452 439146729 244880499 180538481 600317978 355783639 198290891 523655463 492061672 394039003 405107826 117066049 286383156 503738381 4…
Output: 1 1 1 1 2 1 1 8 1 1 1 2 3 1 7 1 1 2 1 2 1 14 1 2 3 1 1 3 1 1 2 3 5 9 27 1 1 3 4 1 2 1 1 1 37 1 1 1 2 4 1 1 2 4 55 1 2 1 1 1 2 5 1 9 1 2 12 1 1 1 4 1 1 3 1 1 2 1 2 6 1 1 1 3 30 1 2 1 1 1 1 5 1 2 3 1 2 1 1 5 1 2 3 1 2 3 4 1 9 1 1 12 1 2 28 1 2 1 1 33 1 2 1 2 5 1 40 1 1 2 4 1 2 1 1 2 1 5 1 2 10 15 1 2 1 1 2 6 1 1 3 4 11 1 13 1 1 1 2 1 5 1 2 3 1 2 12 1 2 28 1 2 1 2 5 91 1 1 2 4 1 1 128 1 2 3 1 5 1 2 1 4 5 1 1 3 4 1 2 7 8 1 1 2 1 2 1 2 5 22 1 1 30 1 2 3 1 1 36 1 1 2 4 1 2 1 2 3 1 1 1 2 1 2 1 6 9 15 1 2 1 23 1 2 3 4 5 1 2 3 1 2 1 1 5 1 2 11 1 1 2 4 1 2 1 8 1 26 1 1 3 30 1 219 1 2 3 1 2 1 1 2 1 2 1 1 2 14 1 1 3 1 2 239 1 2 1 4 1 6 1 1 3 1 2 12 1 2 1 2 1 2 1 2 3 4 1 8 11 1 1 1 4 1 2 1 2 1 1 1 2 1 14 1 1 2 1 338 1 2 1 2 5 1 1 1 9 1 1 3 1 2 1 4 1 2 1 11 1 2 1 2 25 1 1 2 1 1 6 1 8 1 1 2 1 4 1 6 1 1 1…

Example 2:

Input: 2756 898354078 631565525 549196033 121510444 622512231 55152793 838226121 393320227 406257020 243633213 845436993 40023491 186993092 966588139 412725855 52334520 106527795 494873619 630513972 963844386 126179131 38038247 184836392 20180553 896844273 108544324 521753187 267087939 258013679 367887807 223540842 374619318 633406089 899655431 294526675 781865928 835134194 10636078 183477612 43189519 482100836 938118448 738874826 596062505 715032881 823990173 529027764 526112318 278175510 393878031 620516430 867993741 300812382 30119369 808434560 625027989 631729032 470881428 787889014 394372228 548263553 287735365 233967246 314129235 403219414 909025140 656850797 161476005 399146017 225243531 853763138 520644516 17038288 102728272 225497636 782003323 818392952 450423732 745240819 362346571 9724…
Output: 1 1 1 1 3 1 6 1 2 1 10 1 2 14 1 1 2 4 5 6 1 1 3 1 5 1 2 1 1 3 1 5 8 14 1 2 3 1 2 1 4 22 1 1 2 4 1 1 1 2 5 10 1 1 3 1 2 1 4 1 2 1 1 3 4 24 1 1 2 1 5 1 1 2 3 5 6 1 2 1 81 1 2 3 1 1 6 88 1 2 1 1 3 1 1 6 1 1 1 3 1 5 13 1 1 16 1 20 1 1 1 2 1 1 5 1 8 1 1 2 3 1 5 15 1 1 1 2 3 5 1 1 8 1 1 1 2 3 14 1 1 1 143 1 2 1 1 1 3 150 1 1 3 154 1 1 1 4 1 6 1 1 2 1 2 1 6 1 1 2 1 2 1 1 8 1 1 18 1 1 1 4 1 2 1 186 1 1 2 1 5 6 1 2 1 2 5 1 2 1 15 1 2 1 4 1 1 7 1 2 3 4 213 1 1 2 1 5 1 2 1 4 1 1 2 13 1 2 1 1 1 2 1 8 1 23 1 2 3 1 1 3 1 2 1 7 11 1 2 1 1 1 1 3 1 2 6 1 1 13 14 1 1 2 4 1 1 7 1 1 1 2 4 1 62 1 64 1 1 1 3 1 1 3 1 5 1 2 1 2 1 1 16 1 1 2 1 5 1 7 1 2 1 1 1 2 3 15 1 1 1 1 4 6 7 1 1 41 42 1 108 1 110 1 1 2 3 4 5 1 2 1 1 11 1 2 1 1 5 6 1 2 1 10 1 1 3 1 1 3 7 1 2 1 1 3 1 24 1 2 1 2 1 2 1 1 1 3 11 1 1 1 3 5 1 42 1 2…

Example 3:

Input: 165 250124458 339425610 475007998 571093900 659170443 726858208 363647153 447720300 165785672 737726856 606375835 861887129 680967134 425536464 128527991 203756626 73882480 407598830 925194935 242048907 200669816 124897536 38137752 589621657 776218749 57790550 440258396 580806343 839234160 620737665 63654655 621307527 234773678 669678202 261525584 933003946 740995454 200181188 554232754 208077960 485909325 704213103 282639742 199332225 935351575 744190686 406870219 429392696 767835036 408270492 601829218 460058954 487736879 440491938 445573156 822384753 7949565 432130519 835322872 455988217 472469687 887078111 602099074 8703139 801797320 191447367 880942322 916306107 484457342 471954442 982503081 315335551 936523099 645250862 597499695 283994861 488143298 112420660 513669345 807398547 2408…
Output: 1 2 3 4 5 6 1 2 1 10 1 12 1 1 1 2 1 4 19 1 1 1 1 5 6 1 2 3 10 1 1 3 1 5 1 36 1 1 2 1 2 5 1 1 45 1 1 2 4 1 2 1 2 1 2 11 1 2 14 1 2 17 1 1 3 1 5 23 1 1 71 1 2 1 1 1 2 1 4 7 1 1 3 11 12 1 16 1 1 3 1 2 1 2 3 9 1 11 1 1 1 3 1 1 2 1 5 1 1 1 24 1 1 114 1 2 1 1 1 6 1 2 1 1 2 4 1 1 1 3 9 18 1 1 1 1 5 1 2 1 1 5 1 12 1 2 1 1 3 1 2 6 1 2 11 1 1 3 1 2 1 1 3 1 7

Constraints:

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

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