CT46335

Last beacons of Xara

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Xara the archivist watches over the quartz ridge of Glimmerfell's stores of beacons. 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: 553 219432205 974442721 742329982 713681051 158071803 691365193 610898014 743609654 815298295 215758559 199705865 229889199 138161471 861590932 919920729 248854650 340297165 24077611 854068271 484235194 176284212 567603237 687337646 361204393 818845512 375264449 418336963 559117127 15980376 608195866 498582885 458519575 254606838 243619063 240197953 999856495 954996699 787559289 615937999 531340619 343301215 198633131 447612950 856093450 217294564 285431138 552291881 4781689 786591333 410789141 997272104 714311734 773504445 386294604 326033126 639601578 268266714 536007508 765947076 860393456 910536446 307791791 161729038 523533865 463471970 591069697 888620249 765342377 605315394 610756064 880340357 551086661 976988692 251456392 175340025 269956013 330038672 689077579 239714845 536680794 …
Output: 1 2 1 1 1 2 1 6 7 1 1 3 1 12 13 1 2 1 4 1 1 3 4 1 6 1 2 3 1 5 1 1 1 1 1 36 1 1 1 1 1 1 3 7 1 2 3 1 5 1 15 1 2 1 1 3 1 2 6 9 10 1 1 3 1 5 6 1 1 2 4 1 22 1 1 3 4 5 1 2 1 9 1 2 1 2 14 1 1 3 1 2 6 1 2 1 2 3 26 1 2 1 4 1 2 1 4 1 10 1 2 1 2 5 1 2 8 1 1 3 1 2 1 7 1 1 2 1 1 3 4 1 2 7 1 1 2 3 1 2 3 1 19 1 1 1 4 31 50 1 2 1 2 1 1 5 1 2 1 4 1 1 1 13 1 2 1 2 5 1 22 1 2 3 4 1 6 1 1 1 32 1 1 1 2 1 5 1 8 1 1 1 2 1 2 145 1 1 3 1 1 6 1 2 1 1 3 12 1 2 3 1 1 1 2 8 1 1 3 1 5 1 2 1 9 30 1 1 1 3 1 2 37 1 2 1 4 42 1 1 2 3 1 1 6 1 1 1 4 11 1 1 1 2 5 6 1 19 63 1 1 2 3 1 1 1 4 1 2 3 8 12 1 78 1 1 1 4 5 1 1 1 2 1 6 1 1 1 4 1 2 3 1 2 6 22 1 1 2 1 2 3 7 1 1 3 1 2 1 1 8 1 2 1 1 1 3 1 2 6 1 1 3 4 11 12 1 17 1 2 3 36 1 1 1 2 4 5 1 1 1 4 5 1 12 1 1 3 1 2 1 1 1 3 1 1 6 1 8 64 1 2 3 1 1 3 1 1 2 4 8 1 13 1 2 80 1 2 1 4 1 6 1…

Example 2:

Input: 3554 475648900 582831088 523854310 491936501 978415304 361971373 620674395 225409929 742367982 931649889 658414421 649120901 955447431 329303588 210085587 99517632 127512797 604238858 681793807 362787607 878303286 531874794 278635662 390640833 699479073 574025128 919942417 248811640 84479702 863666560 5649511 885837049 447926231 540799653 628211992 903079569 178051087 397087502 660850613 882485341 459525788 162563259 313936384 118991771 351306884 452746480 412690779 117473500 435766026 240903860 29477698 274505529 987940 109626651 903698090 238861053 576306794 257834363 281135662 429180688 386633111 28549697 118886165 849459902 635463071 622141362 28033783 232473584 760709186 290804184 935710911 311240693 528644210 471621006 25976945 341094303 869336705 803680273 450485692 450914818 225722…
Output: 1 2 1 1 5 1 2 1 4 5 1 1 8 1 1 1 2 5 6 1 8 1 1 2 4 1 14 1 1 3 1 5 1 2 3 9 1 2 3 4 1 1 2 1 4 5 1 1 3 1 1 3 1 2 28 1 2 1 2 3 1 1 2 9 1 1 1 2 5 1 58 1 2 1 1 2 6 1 1 2 1 1 5 6 85 1 2 3 4 5 1 2 1 2 5 1 2 1 1 3 1 2 1 4 1 9 1 2 1 4 16 1 18 1 2 1 1 3 24 1 2 37 1 1 2 4 1 1 3 8 1 1 3 1 2 1 1 1 3 10 1 2 1 2 1 1 1 4 5 8 11 1 2 3 33 1 1 1 2 1 2 1 4 1 10 1 1 1 3 5 6 1 1 2 1 21 1 2 1 2 3 1 2 6 1 2 3 1 2 3 1 2 1 194 1 1 2 1 1 5 1 2 3 1 2 3 1 14 1 2 1 4 1 2 1 2 1 6 1 1 2 4 1 1 1 2 1 2 17 1 2 1 1 40 1 1 1 1 3 1 2 3 4 10 1 246 1 2 3 4 1 1 3 8 1 2 11 1 1 2 4 1 6 1 2 1 1 2 4 7 1 1 16 1 2 1 2 3 4 5 1 2 3 11 1 2 1 4 43 1 2 3 1 5 1 1 3 1 2 1 7 1 1 2 3 12 1 2 15 1 2 1 1 2 6 1 2 3 1 11 1 1 14 15 1 1 3 4 1 1 7 8 39 1 2 3 4 1 2 46 95 1 2 1 2 5 1 1 2 4 1 6 1 13 1 2 1 4 5 1 1 3 1 1 11 1 2 14 15 1 2 1 4 1 6 1 1 3 1 2 1 7…

Example 3:

Input: 2706 859910130 758938926 116429395 805302451 131882582 361699705 961457131 721215101 63867586 127468213 454063323 407122445 58364592 579134426 506678053 720061246 753980990 76445783 941457255 933708613 778708826 836498648 546798550 287949418 455428309 668320001 734692006 318202787 358861530 744207843 457550402 711013898 888586033 975875486 687846927 757065872 860406496 375923645 969599531 475323285 927169860 449600615 873087892 656618882 155985242 518389609 107931198 901086714 197036167 900787336 270474020 891595120 326735452 511639238 641762360 645294995 52337467 1860658 506811182 609123823 663350100 302485230 543063754 35832707 223502700 26194847 11297714 513484704 949036106 509756362 136635509 181353882 696608857 628583170 571079703 66206525 233663939 82959504 216726747 175219221 669966…
Output: 1 1 1 3 1 2 7 1 1 2 3 1 1 6 1 8 10 1 12 1 1 2 1 1 2 4 5 1 2 8 1 2 13 34 1 2 3 1 5 1 2 1 2 1 1 2 1 7 1 2 1 2 1 2 3 4 1 1 3 4 9 1 2 1 2 1 1 5 30 1 1 2 4 1 1 1 2 1 2 1 8 1 14 1 2 1 1 2 6 1 1 2 24 1 56 1 2 1 1 1 6 7 103 1 2 1 1 5 1 1 1 1 3 1 2 1 9 1 1 2 1 2 3 6 1 1 3 1 2 1 4 1 2 134 1 1 1 2 4 5 1 1 2 3 10 1 2 1 2 1 17 1 2 1 2 5 1 1 3 4 1 2 3 4 5 10 1 2 1 19 1 2 1 1 1 1 7 1 1 3 1 1 1 7 1 1 1 2 3 5 6 22 1 2 1 2 1 4 1 8 1 2 1 4 1 2 3 4 39 1 2 1 1 1 2 5 1 1 1 9 1 2 1 1 3 1 2 8 1 1 22 1 2 3 1 5 1 2 1 2 1 2 3 8 1 1 11 1 2 1 2 1 1 23 1 1 1 4 28 1 1 1 4 1 2 1 2 5 1 1 1 2 10 43 1 1 1 4 1 2 3 1 1 3 11 1 1 1 2 1 2 1 19 20 1 2 3 1 2 6 1 2 3 1 2 1 2 8 1 2 1 1 3 1 7 42 1 2 1 1 5 6 1 1 2 3 1 2 1 56 1 2 182 1 2 1 4 5 1 1 2 4 1 1 3 13 1 1 2 4 1 1 3 1 1 3 1 2 1 2 1 6 30 1 2 1 2 1 6 1 2 1 10 1 1 1 4 1 1 1 18 49 …

Constraints:

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

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