CT51250

Potter's Ledger of beacons

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

The clerk Potter has been asked to chart the migration season. On the desk lies a long table of beacons 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: 3338 213727816 637244265 443401959 74764376 446519491 140722765 649187422 964790386 217364992 200084242 361902600 444462330 38845751 130468116 9261575 944309873 960621221 51578246 14782303 399752596 811582451 761865083 349859027 86851455 781332657 68074497 978789024 468771776 285803628 685884653 624696970 300361817 441137728 183310851 687649222 712820057 842361372 145167614 517039178 538333862 494720088 231637314 670005078 544654367 297654736 28681429 568629904 86258230 955150244 176829960 181026996 141114262 702886438 658846487 408423963 142431391 503928653 868479673 321799571 125924997 196463623 819816678 849236378 697777914 202818035 457617520 162893843 339817757 5978204 494000842 432109527 230225824 348781775 141930391 956896373 282649892 112520857 170285518 91086829 70750456 252429265…
Output: 1 2 1 1 3 1 7 8 1 1 3 4 1 2 1 8 9 1 1 3 4 1 1 1 4 1 27 1 1 3 1 1 2 1 8 9 10 1 2 3 1 1 6 1 1 1 4 1 22 1 2 1 4 1 1 1 3 9 1 1 2 4 5 1 1 2 1 2 1 6 1 1 2 1 48 1 1 2 1 1 5 7 8 1 10 1 12 1 2 1 4 1 1 3 20 1 2 71 1 1 3 1 1 6 7 1 9 1 2 3 1 1 3 1 8 1 2 1 2 3 1 2 3 1 1 3 12 1 1 23 1 2 3 4 1 2 1 1 2 6 1 2 13 1 2 3 4 1 2 3 1 2 1 2 1 58 1 2 3 1 1 64 1 2 1 2 1 168 1 2 1 1 2 3 5 1 9 1 1 12 13 1 2 1 2 1 1 1 1 2 6 9 1 2 1 1 3 1 7 1 1 1 20 21 1 1 3 4 1 1 2 8 1 1 215 1 2 3 1 5 6 1 2 224 1 1 3 4 1 2 1 4 1 1 3 1 5 1 11 1 2 14 1 2 1 1 2 3 1 26 1 2 1 2 3 1 5 8 1 2 37 1 2 1 1 3 1 2 1 1 8 1 1 3 4 1 1 17 1 1 1 1 1 1 7 1 26 1 1 3 1 2 6 1 1 3 10 1 2 3 1 2 6 1 18 1 46 1 2 1 2 1 1 90 1 1 2 4 1 1 3 1 1 10 1 1 13 1 1 3 4 18 1 20 1 2 1 2 3 1 7 1 9 1 1 3 123 1 1 1 1 2 5 1 1 1 3 1 1 7 1 1 1 2 18 1 2 1 1 3 4 5 1 2 1 1 3 4 12 1…

Example 2:

Input: 1020 328019210 433204278 653609953 553127630 419435068 840921624 147253203 238249372 794116096 635797968 53030436 746708641 911183083 44992674 814690599 158011412 307508770 512885443 677324794 438789199 46731821 246142940 17049965 975434453 940555739 424056576 263604670 380555897 996203166 179232863 559408033 650108894 330868468 624592886 387638506 402350937 122794431 665107406 758372689 992809870 635526944 295704118 45360533 546146482 8871047 116103285 751550813 77182036 548573409 541275402 260517254 301253129 828786638 765395494 698031916 569678861 369811318 731066033 709324519 91854764 482735848 510638248 134720729 375992072 105740333 489987321 430667944 505751464 302057041 619745206 285843972 934895690 23675445 347774410 106143320 288814625 680815183 648781510 341527744 421174493 91719…
Output: 1 2 3 1 1 6 1 2 3 1 1 3 13 1 2 1 2 3 4 1 1 2 1 24 1 1 1 2 29 1 2 3 1 2 1 2 1 9 10 11 1 1 1 3 1 2 7 1 2 1 1 2 13 1 1 1 1 4 1 1 2 3 1 2 1 4 1 6 1 11 1 32 1 2 1 2 5 1 1 2 9 1 2 3 4 1 2 3 1 9 1 2 3 13 55 1 1 3 1 1 1 7 8 1 2 1 12 1 69 1 2 3 1 2 1 4 8 9 1 1 3 4 1 2 3 1 1 19 1 2 1 4 1 6 95 1 2 3 1 2 1 2 1 2 5 1 1 3 1 2 1 2 1 6 10 11 1 2 1 2 3 1 18 24 25 1 2 3 1 1 6 1 1 1 3 4 1 2 7 1 10 1 1 13 1 21 1 1 2 4 1 2 7 1 2 1 2 5 1 1 1 2 17 1 1 1 1 2 1 2 8 1 2 3 1 176 1 2 1 2 3 1 1 2 4 1 11 1 2 3 1 1 1 3 5 1 2 1 2 1 1 5 1 7 1 2 1 2 5 1 2 3 1 10 11 12 27 1 1 3 1 35 1 1 3 1 5 1 2 1 4 5 1 1 3 1 5 1 17 1 2 3 4 22 1 1 2 3 1 2 3 4 5 67 1 1 2 1 2 1 4 5 263 1 2 1 2 5 1 2 8 1 2 3 4 1 2 3 1 1 2 4 1 1 2 3 24 1 2 3 1 1 2 1 1 1 7 11 1 1 1 3 4 1 1 8 1 2 11 1 2 1 2 1 1 3 8 1 2 3 4 1 14 1 16 1 2 1 4 5 1 1 2 3 1 11 1 2 1 …

Example 3:

Input: 2827 73105238 180062673 116471176 225472983 19353927 66255317 431348511 44811735 478192934 442247415 681164431 944478056 220926647 951063782 309820789 976403156 768077135 92458474 588050003 790394931 423165322 599358494 666630641 691048970 315082626 58717027 707767220 352286344 134048485 487293000 607725787 377301771 17437431 499460638 403595449 918208123 982780575 962352617 509306076 568107923 493462778 57890544 968798412 508956422 210793853 53525817 559215224 957935332 666655153 44608883 280979715 601241906 623305672 388920865 199420376 805437365 651152122 378146727 265354240 569735866 525691297 53998589 734979181 456434492 364785780 502117269 976158644 833463495 269231663 231444588 413637651 949252204 18926507 238083220 633361610 872686099 334789450 283051041 447262803 200807391 4504040…
Output: 1 2 1 4 1 2 7 1 9 1 11 12 1 14 1 16 1 1 2 4 1 2 3 4 1 1 7 1 1 3 4 1 1 3 1 20 37 1 1 2 1 1 6 1 1 1 4 5 1 1 2 3 4 1 1 8 1 1 1 3 1 1 7 1 1 3 30 1 1 1 3 5 1 2 3 4 1 1 3 1 5 15 1 1 1 3 1 1 2 8 9 1 2 3 1 1 6 1 99 1 2 1 2 5 1 1 1 4 1 1 3 112 1 2 1 2 5 1 1 1 3 5 1 2 1 9 1 16 1 2 1 1 3 1 2 8 1 2 3 1 2 3 4 32 1 1 2 3 1 2 1 1 1 9 1 44 1 1 3 4 5 6 1 1 3 1 5 1 2 1 1 60 1 2 3 1 5 1 2 1 1 2 4 1 73 1 1 1 4 5 1 7 1 1 1 11 1 1 1 3 1 2 3 8 20 1 1 1 1 5 6 1 2 3 1 1 1 2 1 2 1 8 1 2 3 1 1 1 4 1 2 1 2 1 4 1 2 27 1 29 1 2 3 4 1 1 1 2 4 138 1 2 1 2 1 2 5 1 1 1 3 4 1 2 1 1 17 1 2 1 4 1 2 1 4 26 1 1 2 4 1 1 2 3 4 1 11 1 2 1 1 1 2 4 1 1 8 9 1 2 3 15 1 2 1 2 1 4 1 6 35 1 1 3 1 1 2 1 8 1 1 3 1 2 1 1 3 4 1 6 20 1 2 23 1 2 3 4 63 1 1 1 2 3 4 1 8 9 1 1 2 4 5 1 2 244 1 2 3 1 2 1 4 1 1 2 8 9 1 2 3 1 1 1 19 1 1 3 1 1 2 26 1 …

Constraints:

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

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