CT51566

Last signals of Petra

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Petra the assayer watches over the peat bogs of Mossgrieve's stores of signals. A careful computation stands between order and chaos. 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: 160 301251098 262046210 651474371 564205589 312715320 132190602 925906616 723377988 641313244 315697961 818159731 887475852 710646771 334111361 143415749 560092719 408637412 931449495 117395688 644827288 497592049 317595366 526138055 312431621 31929590 922458394 718219862 624102565 454165116 898826634 400070924 465205323 379246889 760266837 55994340 977669284 525421045 207551941 273337295 34198737 982235274 731642001 702423389 126671975 687818838 742378780 570945826 986598153 419431808 874247863 605300653 748615784 546229003 791401076 126814317 97447709 711366855 448705921 564495150 449529878 378394127 705398529 584867456 299173973 550612868 407336946 725983098 803829043 115262810 905938254 30986947 68054633 350458566 513617385 809542792 775023946 757713070 426849983 429473947 701791578 26…
Output: 1 1 3 1 1 1 7 1 1 1 4 5 1 1 1 3 1 18 1 2 1 1 3 1 1 8 1 1 1 4 1 2 1 4 1 36 1 1 2 1 41 1 1 1 2 5 1 48 1 2 1 2 1 4 1 1 3 1 2 1 1 5 1 1 2 1 13 18 1 22 1 2 3 4 5 1 1 1 2 3 1 5 1 2 15 1 1 1 1 1 4 1 6 1 1 2 1 50 1 2 101 1 2 1 1 3 6 1 8 1 2 1 12 1 14 1 1 3 18 1 2 3 1 1 3 4 8 1 1 2 3 1 32 1 2 1 4 5 1 2 1 4 1 43 1 1 3 1 1 2 1 1 1 2 11 1 2 3 4 5

Example 2:

Input: 958 307093697 712281292 274632638 581507610 154699585 647433456 348116179 361022723 621795153 87896937 80664868 360397770 391059813 747956330 958507682 854370668 748546243 358252503 58137920 532254990 3913724 730785808 447471109 42183284 863048452 268559003 964718782 563209064 433096293 38646191 368643478 883687867 370518823 473129313 694947626 224494363 395804249 561587786 407221593 329113182 155659153 412079916 822268036 342888383 842196153 37741907 429705302 472362407 315678427 417928855 145241805 339284610 474931016 114627182 729761659 740719594 26230097 411418699 175802407 29635691 961894788 947105350 536508790 671752131 831179913 67133085 559958827 734655089 268339805 677367876 52387439 380535462 645149810 618002889 771198904 478376361 952154530 686833610 130762573 279289144 81364381…
Output: 1 2 1 2 1 4 1 2 3 1 1 3 4 14 15 1 1 1 1 3 1 5 1 1 10 1 27 1 1 1 2 5 1 2 3 1 2 3 1 1 1 4 11 1 13 1 2 3 1 2 1 2 8 1 10 11 1 2 1 1 34 1 1 2 3 1 2 3 1 2 1 2 3 1 10 1 16 1 1 2 4 1 1 3 1 2 3 1 12 1 2 1 2 1 1 2 8 1 10 1 2 102 1 1 2 3 1 6 1 2 1 1 5 1 2 1 1 1 1 2 8 14 21 124 1 1 1 4 1 1 3 1 2 6 1 1 2 1 1 2 17 1 2 3 21 1 1 2 3 1 5 1 1 1 3 1 11 1 2 15 1 38 1 1 3 1 1 2 3 1 1 2 4 1 2 3 1 13 1 1 1 4 18 1 2 3 1 5 1 190 1 2 1 1 2 3 1 1 3 1 2 10 1 2 3 1 2 16 1 1 2 1 4 1 1 1 8 10 1 2 1 14 1 1 2 1 5 1 1 1 4 1 1 3 1 2 29 238 1 240 1 2 1 2 3 1 2 6 1 1 1 10 11 12 13 1 15 1 2 3 1 2 21 1 1 2 1 4 5 7 8 1 1 1 4 1 2 1 2 1 39 1 1 2 1 2 1 4 5 1 10 1 1 13 1 1 3 1 2 1 1 8 1 2 1 1 5 1 15 1 2 1 2 314 1 2 3 1 1 6 1 1 3 1 1 3 7 8 9 1 2 1 4 5 1 7 8 1 10 26 1 2 1 2 1 1 3 4 1 2 3 1 13 1 2 3 1 2 3 7 1 1 10 1 1 1 1 3 29 1 1 2 3 …

Example 3:

Input: 1587 704268902 476192266 273493369 457676388 631102617 555328350 909085554 83403602 482466729 926436565 913977759 441108887 770811417 220016648 812697054 405375331 464484931 533305502 954159849 528835481 694985402 751548594 73482302 705620179 477027674 263099152 100363856 584254632 661497787 782295332 138423719 495734224 15724731 937766162 858022017 631019322 315897090 492219600 112450396 792178121 501594469 287094722 517988874 212570651 608324226 968113832 586625912 926463780 494522007 775719547 543612002 300620993 879014393 60425912 828484114 940115219 356081582 300110442 514876545 815948193 828861324 77338773 450566515 904144083 913561718 431152838 437277210 966730212 168086277 833955739 664954152 929653294 418913493 101564796 237307387 705629763 811900677 959913824 680022487 355197469 …
Output: 1 1 1 2 4 1 7 1 2 10 1 1 2 1 4 1 2 3 19 1 2 3 1 2 1 1 1 4 5 11 1 2 1 15 1 1 1 2 1 5 1 1 3 1 5 46 1 2 1 2 1 1 5 1 2 10 1 1 3 4 5 1 2 8 9 1 2 22 1 2 1 4 1 1 2 4 5 10 1 1 3 1 1 3 1 5 1 2 1 2 13 1 2 1 1 5 6 1 1 2 4 1 1 7 1 2 1 108 1 110 1 2 3 1 1 3 1 1 2 1 1 6 10 1 2 1 2 1 2 1 8 1 1 3 1 1 3 1 1 3 1 1 143 1 1 3 1 2 3 1 1 9 1 2 3 1 1 1 1 4 1 10 20 1 2 3 1 5 1 1 3 1 1 3 1 1 1 1 8 1 1 2 1 4 1 1 8 25 1 2 1 1 1 4 1 1 9 1 2 3 4 5 1 1 1 1 1 4 5 8 1 10 1 17 27 1 217 1 1 1 1 2 4 1 2 1 2 1 1 11 1 2 3 16 1 1 3 1 22 1 2 3 1 5 1 2 1 1 1 2 1 13 1 2 3 4 1 2 1 1 5 1 1 8 13 1 2 1 2 1 19 1 34 1 1 3 1 1 2 7 1 1 3 4 5 1 2 1 16 1 2 3 1 1 2 3 4 1 1 11 1 1 3 15 16 1 1 1 4 5 1 1 1 1 2 3 1 2 1 9 1 49 1 1 3 109 1 1 3 1 2 1 7 1 1 2 1 2 6 1 15 1 2 3 1 2 3 1 2 3 7 1 1 1 1 1 31 1 2 3 1 2 1 2 1 1 3 1 5 6 11 1 2 3 4 1 1 1 3 2…

Constraints:

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

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