CT45769

The Streak Back of Silkmead

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

The harbor bell rings at the mulberry rows of Silkmead; Isha weighs the day's marks manifests and starts the calculations. 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: 2239 702309216 146153314 286826683 723263426 559383639 846037346 770500899 875326217 572427741 703687215 557951776 630072818 713696659 244499879 776410122 915987865 7812875 164479651 407783749 419966374 826902102 21310506 478964834 761798288 696277139 525464830 147376820 148884988 814234055 443790842 277472756 246375171 421623394 632046132 36679581 203266166 858278323 575183780 881759057 404101430 757814053 466498373 255917842 258277917 223114035 457029093 597843157 899905335 378633409 37117764 938138971 891224316 765438260 216153049 621806422 137084974 936224431 728899865 756075480 806847804 238097430 784447067 937125597 168408291 437668931 606121708 884632318 909517383 589562320 393123285 789072049 633074983 249431190 679371550 825037114 984003506 50055174 226759269 341612040 620794281 8…
Output: 1 1 2 4 1 6 1 8 1 2 1 2 5 1 7 16 1 2 3 4 5 1 2 3 1 1 1 2 8 1 1 1 3 5 1 2 21 1 23 1 2 1 1 2 1 4 6 32 1 1 51 1 1 1 2 1 6 1 2 3 1 2 12 1 2 3 4 5 1 1 3 1 1 3 7 76 1 2 3 4 5 1 1 3 1 86 1 1 1 90 1 1 1 2 5 1 2 1 1 5 11 1 1 1 1 2 1 4 1 20 1 22 1 2 3 4 1 1 3 1 2 6 11 1 1 3 1 5 1 1 2 1 4 1 7 1 14 1 1 1 4 1 20 1 2 1 4 5 6 7 1 1 1 1 4 1 2 3 1 2 6 11 1 2 1 2 1 2 1 2 1 82 1 2 1 1 1 3 1 5 1 1 8 1 2 3 4 1 6 18 1 1 1 1 1 1 4 198 1 2 3 4 1 1 3 4 5 6 1 2 1 2 3 1 1 1 3 1 5 1 2 3 21 1 1 2 1 2 6 1 8 1 1 3 1 2 3 1 37 1 1 1 4 1 2 1 2 1 6 1 2 1 2 3 12 1 55 1 2 3 1 2 3 7 1 9 1 2 3 1 2 1 75 1 1 3 1 1 2 1 8 1 1 3 1 5 1 1 1 3 1 2 7 1 22 1 1 2 4 1 2 3 1 5 10 11 1 1 2 3 1 17 1 1 20 118 1 2 1 2 3 1 2 1 2 5 1 2 13 1 2 3 4 1 2 7 1 2 3 4 1 6 1 2 1 2 1 4 7 34 1 2 3 1 1 1 2 8 1 2 11 1 2 1 4 1 6 1 2 3 1 1 1 7 25 26 1 2 1 1 5 1…

Example 2:

Input: 1649 344215865 694922743 122764774 755084144 270594677 775539062 512091373 477930937 740866529 190984871 118682518 885910843 630887317 999219191 659274529 500147160 431815093 585996292 901149102 276633152 925221676 756255748 578680725 299192156 573476538 935334812 429863416 690312310 992353432 954664508 764968126 740676881 421966070 626828034 971213945 9431249 487435818 167959935 52037692 325639688 477131432 937260000 619798417 114351359 547342272 945654288 245951364 301365440 580512193 129654672 241860131 663148063 361285864 717332383 495937150 552940936 867446289 396044698 132434059 285194658 271585740 477374296 346903129 420524509 156454684 668705913 102576096 551591359 382884383 224738941 711652986 939189267 473518509 746354699 938898165 301526929 510085052 957142075 19174212 300771497…
Output: 1 2 1 4 1 6 1 1 3 1 1 12 1 14 1 1 1 3 5 1 7 1 1 1 2 12 1 2 15 1 1 1 1 2 6 1 2 1 1 3 4 7 1 1 2 11 1 2 3 1 2 6 1 8 1 2 11 1 1 2 1 5 1 2 1 9 1 2 1 1 14 26 1 2 3 1 2 43 1 2 3 1 2 3 1 5 1 1 11 1 2 1 4 5 1 2 1 1 1 3 1 6 14 1 76 1 2 3 1 2 1 1 1 1 2 1 12 1 1 1 4 1 18 1 1 1 2 5 6 1 8 1 2 1 4 31 1 1 1 3 127 1 1 1 1 2 6 1 2 9 10 1 2 3 1 1 2 4 8 19 1 1 3 1 2 1 4 1 1 3 1 9 1 11 1 2 36 1 1 1 1 3 42 1 1 2 1 4 1 2 1 2 9 11 1 1 3 1 5 1 1 3 1 1 3 1 1 1 2 1 6 7 1 2 10 17 1 2 1 2 27 28 1 2 1 4 1 1 2 1 9 1 2 51 1 1 2 3 1 6 7 59 1 1 2 3 4 1 1 1 4 1 1 3 1 1 3 1 2 1 2 5 6 10 1 1 3 1 5 1 2 3 1 2 3 7 34 1 2 1 1 2 3 1 2 3 4 8 1 2 3 1 2 15 1 2 3 56 1 2 3 1 2 1 4 1 1 1 4 1 2 1 1 1 6 1 8 1 18 1 20 1 22 1 1 1 1 2 5 1 8 9 1 151 1 2 3 1 2 1 1 2 6 1 2 9 1 11 1 2 1 338 1 1 1 1 3 6 1 1 1 4 1 2 7 1 2 3 17 1 2 3 21 1 1 2 1 4 1…

Example 3:

Input: 1515 214008610 865181139 964467074 163189431 408670895 800511651 208589683 891932231 925837266 91470363 381365261 505525627 551241304 777501684 763065063 937109146 723085311 291558403 809723722 259039584 971423719 808591179 7288088 311081052 330772795 416583540 402119556 392322099 646806631 459932136 772366685 827972116 915140852 303112191 810276815 682263794 846928252 931738963 428156569 380106392 999435418 891031762 39374867 186276098 661061480 444895364 653357579 813986746 317487692 979206437 705557595 169462366 463429248 178549804 275487763 251582147 376080304 110425755 309574731 976061953 815435685 406357987 52846719 968483943 493822085 898494992 885668116 20898504 942534609 601760824 928521914 960066109 860845727 905928822 51314761 241806112 354424502 427760734 482607622 300244173 29…
Output: 1 2 3 1 2 3 1 5 6 1 2 3 4 5 1 13 1 1 3 1 21 1 1 2 3 4 1 1 7 1 9 11 12 1 2 1 4 17 1 1 41 1 1 2 3 1 2 6 1 9 1 1 2 1 2 1 4 1 2 10 1 1 1 4 1 2 1 1 5 1 2 8 1 2 1 2 3 4 5 1 1 1 11 20 1 1 2 1 5 1 1 3 1 2 1 46 1 1 3 1 2 3 7 1 1 1 4 1 2 14 1 2 1 1 1 1 2 1 7 1 1 3 11 1 2 1 31 1 2 1 2 1 2 1 2 9 1 1 3 1 2 3 1 1 18 1 1 1 3 1 6 1 1 3 1 2 1 7 1 2 1 2 122 1 2 1 4 1 1 3 1 1 2 3 1 5 10 1 2 3 140 1 2 3 1 5 1 2 1 2 1 2 1 6 1 10 1 1 2 3 5 1 2 1 4 1 6 1 1 14 25 1 27 1 2 1 2 1 2 5 8 1 2 38 1 1 1 2 1 4 1 8 1 1 1 2 13 1 1 1 17 18 1 20 1 65 1 2 1 1 5 1 1 2 1 10 1 1 1 3 1 6 1 1 1 1 5 1 23 1 1 2 1 2 6 7 1 2 1 2 5 1 2 15 1 1 2 19 1 1 2 23 1 1 1 3 1 5 1 2 1 1 122 1 1 3 1 5 1 2 3 4 1 1 1 2 5 1 2 1 13 1 2 1 1 1 6 147 1 1 2 1 1 3 1 8 9 10 1 1 13 1 1 2 1 4 1 2 8 1 2 1 4 1 1 2 1 1 2 1 2 3 4 1 11 17 1 1 3 1 2 31 1 1 3 1 1 6 …

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
The Streak Back of Silkmead - MEDIUM Coding Problem | CodeTikki