CT36337

Last registers of Pavel

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Before the gates of the smokehouses of Brineport close for winter, Pavel must finish the registers ledger - one figure at a time. 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: 3051 618053176 314083038 835055546 102896244 49289808 84525554 455558095 95744879 167188315 360931981 706582482 693921611 108583588 232721645 292324490 735631690 328301892 565381687 367148783 719924300 946322596 716304016 455307545 926378999 808932377 160104819 830369592 565546578 659700631 52162968 430023990 216278230 206114134 806524215 290305501 97007592 654940121 25720538 954638499 278678976 633362702 6135386 280448562 702887843 760730406 815876237 11854996 895387059 818821649 657044887 1683810 621162351 433039685 691595693 846791402 874116523 582299391 243813022 89076123 878462576 533731445 769366696 347642231 633792615 194493711 938600728 628300980 821232845 444218472 959080492 208482323 476741843 633812506 277792955 904323395 404291281 551728264 81535335 423216953 314039959 26338779…
Output: 1 1 3 1 1 2 4 1 2 3 8 1 1 2 3 13 1 2 1 4 21 1 1 3 1 1 3 1 2 1 2 1 1 7 1 1 3 1 39 1 2 1 2 5 6 7 1 9 1 1 1 2 1 5 7 8 1 1 1 12 1 2 1 2 1 27 1 2 1 70 1 2 3 1 5 1 2 1 2 1 1 1 6 9 10 1 1 1 2 15 1 1 1 4 1 2 97 1 99 1 1 1 1 2 4 7 107 1 1 1 4 1 6 7 1 1 1 2 4 1 1 2 1 5 10 1 2 1 1 23 1 1 3 4 5 1 1 1 2 1 34 1 36 1 1 2 1 5 1 2 1 2 3 1 7 13 1 1 3 1 2 3 7 1 1 59 1 2 1 2 1 2 1 4 7 1 1 2 11 1 1 14 1 2 17 1 1 22 1 1 3 4 1 6 1 8 1 2 1 1 3 4 5 1 1 2 4 1 1 3 1 16 1 1 49 1 2 3 1 2 1 1 8 1 2 11 1 2 1 1 5 1 2 1 1 1 2 5 1 1 3 1 10 11 1 2 1 1 2 1 20 1 27 1 1 1 1 4 1 1 8 1 10 49 1 1 3 1 2 3 1 8 1 59 1 1 2 1 5 1 1 1 4 5 1 2 1 2 1 2 3 185 1 2 1 1 5 6 1 2 3 1 5 6 1 2 1 10 1 2 1 1 15 1 1 1 4 1 1 2 4 1 1 7 1 2 3 1 2 3 1 8 1 2 1 12 39 1 1 2 4 5 1 1 2 1 4 1 1 2 9 1 11 62 1 1 2 1 2 1 6 1 1 1 10 1 1 3 4 1 1 2 4 1 1 7 8 9 1 1…

Example 2:

Input: 811 137260082 87756863 937490665 255226525 939994592 885999190 99905467 244703170 722737526 928489928 734398705 858757137 155973316 815853874 316242082 972734967 213321873 985217606 721289452 168230244 570187879 753865645 226479675 271930039 678323054 22149502 417457433 621525429 997089439 997906133 616813498 835602067 21260216 640643538 870992503 136929200 903502081 341311268 192405995 464639401 440571248 649552631 133962745 131698970 535578211 993058127 28714449 100273359 369874356 909939433 470995235 953691792 303766316 307212100 319414046 2772836 937054031 370463297 873102927 12850107 156051880 894765414 766848193 965643432 768856190 83899886 216559137 865199200 111121008 723604055 642113353 77561133 198952271 366015543 900081495 667421229 541890023 724241415 226964108 966641761 276653…
Output: 1 1 3 1 5 1 1 2 3 5 1 2 1 2 1 16 1 18 1 1 2 4 1 2 3 1 2 3 29 30 1 2 1 2 5 1 7 1 1 3 1 5 1 1 3 16 1 2 3 4 1 6 1 2 3 1 5 1 2 1 2 5 1 18 1 1 2 4 1 2 1 1 2 3 11 1 1 3 1 34 1 1 2 4 5 1 7 1 2 3 1 5 1 1 1 1 5 1 1 3 1 10 1 12 1 2 1 1 5 1 2 3 1 34 1 1 3 1 39 1 2 1 2 5 6 1 2 1 1 5 1 1 1 3 5 1 57 1 1 3 1 2 6 1 145 1 1 3 1 2 3 1 1 1 4 1 6 7 1 2 1 4 1 16 1 2 1 4 1 2 3 1 5 1 1 8 1 1 34 1 1 2 1 4 1 6 8 1 2 11 1 2 3 1 2 1 4 1 6 7 1 2 1 2 12 1 2 3 16 1 1 2 4 1 1 71 1 1 3 1 2 3 1 2 1 4 5 1 2 3 1 2 6 1 1 14 18 1 20 1 1 1 4 1 1 2 31 1 1 3 1 1 1 1 39 1 2 258 1 1 1 3 1 5 1 1 1 1 4 1 6 8 1 2 1 1 2 3 15 1 2 23 25 1 2 3 1 5 1 2 1 9 1 2 1 1 3 1 1 3 4 5 1 1 2 9 49 1 2 1 2 1 4 1 8 1 1 1 3 1 1 3 1 2 3 1 2 6 1 2 3 25 1 2 3 1 2 3 32 1 1 1 2 1 1 1 7 1 1 1 4 5 1 2 3 1 1 2 4 20 1 1 3 4 1 2 28 1 1 3 4 5 1 2 3 1 1 6 1 1 2 1 …

Example 3:

Input: 2714 421613804 164258187 341393973 123853481 8390647 162562330 637601207 956427470 134897271 662775646 24646847 927862049 919321236 63381262 608092007 466432564 499412004 86918429 910563607 446668484 61563893 391247641 755631456 399707101 905858145 410547437 951759364 234998723 709886175 305292639 153108218 741224325 370519854 226607063 702909831 82247684 760418711 242502137 672123066 740952206 423549741 235178975 771494513 398260579 232602097 45315522 40020841 649996754 521615138 665407876 1501782 904090802 715681500 522680038 807519257 905649822 570633604 361169428 758868169 756400577 78965809 845840600 414840542 344492376 372505056 785878411 769665300 523638115 896186122 217373976 905869831 187179616 406458363 430006879 542787317 28312234 212646912 178136729 884639592 293161548 16117629…
Output: 1 1 2 1 1 3 7 8 1 2 1 4 1 1 2 1 2 1 6 1 1 2 4 1 6 1 19 1 2 1 1 5 1 1 3 1 10 1 2 3 1 1 16 1 1 1 1 5 1 7 1 25 1 1 3 29 1 1 3 1 1 6 1 1 2 4 1 1 13 1 44 1 2 3 4 1 2 1 8 1 1 3 1 1 1 4 1 1 1 3 9 1 1 15 1 2 3 1 1 3 4 1 1 7 1 12 13 1 15 1 2 3 1 2 1 1 1 3 25 1 1 1 2 5 1 2 8 49 1 1 3 4 1 1 64 136 1 1 1 3 4 1 1 1 2 1 6 11 1 2 1 4 5 18 1 2 1 2 3 1 2 1 4 10 1 166 1 1 2 4 1 2 1 2 3 1 2 1 4 1 2 3 1 5 6 1 2 1 4 1 1 17 1 2 1 4 1 1 2 4 5 1 2 1 9 1 2 3 1 5 6 1 1 1 1 5 1 7 23 28 1 2 48 1 2 1 4 5 1 1 2 3 5 1 2 3 1 2 67 1 1 3 1 1 1 7 1 2 10 1 2 1 4 5 1 2 3 1 259 1 1 3 4 1 1 2 3 5 1 2 271 1 2 3 1 2 1 1 3 1 7 1 1 1 3 1 13 1 2 16 1 2 1 4 1 2 1 4 5 1 2 3 1 1 1 1 2 6 1 2 1 4 19 1 1 42 1 1 3 320 1 1 1 1 3 5 1 1 1 3 10 1 1 3 1 2 17 1 2 1 4 1 1 7 1 1 10 1 12 13 1 15 1 2 1 1 3 1 1 3 1 1 3 1 28 1 1 2 3 33 1 2 1 2 1 2 7 1…

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
Last registers of Pavel - MEDIUM Coding Problem | CodeTikki