CT46831

Wren's Streak Back Ledger

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Wren the paymaster watches over the forest village of Briarthorn's stores of registers. 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: 1414 414066235 69998436 434533318 530962349 511708802 190406328 408170359 711063729 346952336 545246570 135556509 752548728 321663730 474909754 503586621 803785913 448497001 169098328 768121536 885068539 727477396 106025620 164131616 536059793 384884975 322118135 641650810 14352126 101017238 836978961 827470234 771823968 768489100 921905147 751174722 244924088 690445579 961777226 119214920 658472536 557095424 448150815 266806954 235946841 96104459 798302789 674088194 552033730 284553852 750593392 692994496 51891907 588807581 72804284 562781764 297865305 350116574 907809762 198496502 55111290 2666067 135708860 321570267 427963807 230041536 430717492 334819196 834355314 956493708 913541017 621506658 499799782 492438219 408869313 966967958 297591198 290199180 296917803 610793426 969713627 690…
Output: 1 1 3 4 1 1 2 8 1 2 1 12 1 2 3 16 1 1 3 20 1 1 2 3 1 1 6 1 2 10 1 1 1 34 1 1 2 38 1 2 1 1 1 1 1 8 1 1 1 4 1 1 2 1 2 1 2 20 1 1 1 3 5 6 1 8 1 10 31 1 1 1 1 1 75 1 1 2 4 80 1 2 1 2 1 2 3 1 9 10 1 1 3 1 1 3 1 2 1 4 1 6 1 8 1 10 11 1 2 1 4 5 1 1 1 9 1 2 39 1 121 1 1 3 1 2 1 2 1 2 5 1 7 1 1 136 1 1 1 1 5 1 2 8 1 1 1 3 4 1 2 7 1 2 1 2 1 4 5 1 17 1 1 2 4 1 1 1 2 3 5 6 1 30 1 2 3 1 1 3 1 1 1 10 1 12 1 1 15 1 2 1 1 2 51 1 2 1 2 3 1 2 1 2 10 1 12 1 1 2 1 1 3 1 2 3 1 1 3 1 8 9 1 16 1 1 2 1 1 5 1 1 9 10 1 1 29 1 1 3 33 1 2 1 2 1 2 248 1 1 2 4 1 1 7 8 1 1 3 1 2 3 1 2 3 18 1 2 3 1 23 1 2 1 1 1 2 1 5 1 2 1 10 1 2 13 1 17 1 1 2 3 5 1 2 1 2 5 11 1 1 1 1 33 1 1 1 3 1 1 7 1 2 10 1 2 3 1 1 2 1 5 1 2 1 1 1 2 5 1 2 1 29 1 2 1 1 3 1 2 8 1 10 1 2 3 1 1 3 1 1 2 1 83 1 1 2 3 1 6 1 1 2 4 1 2 1 4 1 1 2 4 1 1 1 2 4 24…

Example 2:

Input: 3176 449893247 507016864 467220794 478526905 549672607 759375854 715470661 829204321 657291919 327535592 752172639 721748650 555329521 508218205 514019669 204009112 660271312 908306451 969134706 326527167 426801423 788428269 304424621 892931543 542235730 213331234 921786756 272539413 912042039 632211677 204805496 431990784 290898229 580753820 598011003 159267797 729243927 687376447 949285852 242105272 805175207 575635585 122966824 229328117 12218371 943124095 234715816 867274553 407484744 403136905 24067632 738748671 853414908 23573004 899572715 733612777 760972116 797864267 871484530 658030842 559192331 599074667 734293284 699763357 484313201 704763810 952788590 510213071 771554257 264504468 171745161 933673856 370666461 894245003 385086851 796378493 234510573 781557891 133174948 94049037…
Output: 1 2 1 2 5 6 1 8 1 1 3 1 1 1 2 1 5 18 19 1 2 3 1 5 1 1 8 1 2 1 1 2 1 4 5 1 8 1 20 1 2 1 1 2 1 7 1 2 1 1 1 4 5 1 9 1 2 3 4 1 1 2 4 1 1 3 48 1 2 1 1 5 1 2 1 2 1 2 1 13 1 1 3 1 2 3 4 1 9 90 1 1 1 2 3 1 5 1 2 9 1 2 1 4 1 2 17 108 1 2 1 2 3 4 1 2 9 1 11 1 1 1 2 3 5 6 8 9 1 2 1 2 3 4 1 2 3 1 11 1 2 1 1 5 1 2 8 1 10 42 1 2 1 4 1 1 1 8 1 1 11 12 1 14 1 2 1 2 1 2 3 1 2 3 7 1 2 1 2 1 2 14 1 1 2 1 1 1 6 7 1 2 1 1 5 32 1 1 2 1 4 5 1 1 2 10 1 2 3 4 1 2 7 1 1 2 21 1 23 1 1 2 1 4 1 7 1 2 3 1 5 1 1 8 1 1 3 1 2 1 4 1 243 1 1 1 1 1 6 1 1 3 1 2 12 1 1 2 1 5 1 2 1 4 1 2 1 1 9 1 1 3 1 5 1 2 3 1 2 1 1 22 1 1 2 1 27 1 2 1 2 1 1 2 1 2 8 55 1 1 3 1 2 1 2 5 1 65 1 1 1 2 3 6 1 1 3 10 11 1 1 1 1 4 6 7 1 328 1 1 1 1 2 1 6 1 1 3 1 1 2 1 2 1 2 11 1 1 2 15 1 2 1 2 5 27 1 1 3 4 1 1 1 2 1 1 3 1 8 10 1 1 2 4 1 1 1 3 4 1 2 1 …

Example 3:

Input: 90 735472209 783033322 214555288 924042203 190381349 611830641 341829360 882479193 766989266 849536357 507461718 933874479 328335794 870857374 526455181 924389593 768494028 85783270 196298132 990231536 879377731 519251175 153774217 927538559 273318708 735909174 976615456 753603237 208035006 761703272 792065999 320499793 528434994 707381549 942401729 810297417 767539073 758532332 83508089 334629240 662778728 864892294 906771740 150043735 824088898 32791617 438474922 132768452 888683915 289579084 928852427 985398181 753379098 723006015 439829201 310487341 734541438 886237323 371628436 973354735 257036605 232197139 21540327 288999114 119178411 263715323 956101546 335988359 653252541 445157394 52628961 324170213 23166819 98443250 439412280 151531476 171550540 208147357 391281313 44759384 14869…
Output: 1 2 1 4 1 2 1 4 1 2 1 12 1 2 1 4 1 1 2 20 1 1 1 4 1 2 7 1 1 3 4 1 2 3 8 1 1 1 1 2 3 7 8 1 2 1 2 1 6 1 16 32 1 1 1 1 4 6 1 8 1 1 1 4 1 2 7 1 2 1 1 2 1 2 5 1 2 3 4 1 2 22 1 1 1 1 3 36 1 1

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
Wren's Streak Back Ledger - MEDIUM Coding Problem | CodeTikki