CT50731

Vigo's Teal Ledger

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

In the basalt cliffs of Obsidian Shore, Vigo the bookkeeper keeps careful count of the beacons. Settle a dispute between crews, every figure matters. 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: 19 616874935 310732127 520030824 733259931 729349970 418911960 655414039 631490936 921401282 433810056 362070672 793161688 115120220 709149355 890172245 948372327 585072968 327435937 632344071
Output: 1 1 2 4 1 1 2 1 9 1 1 3 1 2 6 16 1 1 3

Example 2:

Input: 815 53349262 88723799 366569777 4054309 574215514 25006792 178088833 406344568 859432956 238494412 259216330 598801761 524261762 895154490 441007554 978491765 814784631 607005138 544427496 911941715 880211191 938065853 806492413 957965930 260946027 29849988 394326185 210760556 261935343 816611412 600350795 883243490 379004048 503334165 306024142 232486615 107895862 170140678 820712664 918872434 174887866 306255065 870493988 701035968 105857193 138093308 725765714 744631488 404153578 858050968 31806778 715850818 443388500 251111150 216122666 335916985 943611738 83566314 530689384 350619320 301907481 252728525 43386191 717014418 439828949 607376121 414945860 864259583 308846353 838191994 887217500 878503627 755192431 645825263 635504881 838002707 826562700 859176346 135740890 388402464 87900…
Output: 1 2 3 1 5 1 2 3 9 1 2 3 1 14 1 16 1 1 1 4 1 6 1 8 1 1 3 1 2 6 1 8 1 2 1 1 1 2 7 16 1 2 3 1 1 2 4 5 1 7 1 2 1 1 1 3 33 1 2 1 1 1 1 7 1 2 1 11 1 2 14 1 1 1 1 4 1 6 1 2 10 1 1 2 1 2 1 1 1 6 1 10 36 1 1 39 1 2 83 1 2 1 4 5 6 1 1 9 1 2 3 1 2 1 4 1 6 1 2 3 10 1 2 1 14 1 1 1 2 1 1 6 1 26 1 1 2 1 2 5 6 1 8 1 2 1 1 1 4 1 6 1 1 3 1 13 1 1 25 1 2 3 1 1 3 1 8 168 1 1 1 4 1 1 3 1 1 3 1 1 1 3 8 1 1 3 1 16 1 2 3 1 2 1 1 24 1 1 2 1 1 5 7 204 1 1 3 1 1 3 7 1 2 1 2 1 6 1 8 1 1 1 4 1 2 3 4 1 10 1 2 3 1 2 3 1 2 3 10 1 1 23 1 2 3 1 2 1 1 2 9 10 34 35 1 1 3 1 2 1 1 1 4 7 1 12 1 14 1 2 3 1 54 1 2 1 58 1 2 1 1 2 1 1 5 1 2 11 1 1 14 1 2 3 4 1 2 3 4 1 2 1 12 1 1 2 3 4 1 2 7 1 9 1 1 1 1 14 1 2 3 18 1 2 3 1 2 3 4 1 28 1 2 1 1 5 1 2 1 4 1 1 132 1 1 1 4 1 6 1 1 1 3 1 1 3 1 2 6 1 2 1 4 21 1 2 1 1 3 4 1 6 1 2 3 4 1 6 1 3…

Example 3:

Input: 3981 994272282 14812171 820276129 225244630 140320860 891172051 608127888 12378634 853961943 743300541 264983532 282475206 907026243 712908253 243589646 879566975 148094913 499791044 766914607 240304957 317614330 340067655 7775476 15459296 267221324 171962415 502123444 667496860 508396223 266480206 553543129 786203320 38685363 332235267 408096818 494348764 153074094 238095243 985933226 519066139 836851071 296689139 224219089 120681238 277269367 563878897 858685075 60338481 501143306 795855565 346113747 45174212 596836198 617216357 925685139 631781032 523941707 184143561 513774421 118514871 239617371 421274823 887451420 967278304 662426406 582979659 576567971 997389835 271971068 142513974 746436266 246337696 661622691 950202801 497132636 391937115 869786735 781721188 97891015 970867256 6557…
Output: 1 1 2 1 1 5 1 1 3 1 1 2 12 1 1 3 1 2 3 1 2 3 1 2 3 1 8 9 1 1 3 16 1 2 3 4 1 2 38 1 2 1 1 1 3 5 8 1 2 3 1 1 3 4 16 1 1 1 2 1 2 3 8 25 1 1 1 68 1 1 3 1 2 6 1 1 3 1 1 12 1 2 3 1 1 6 1 1 1 1 4 1 2 3 4 1 1 3 13 1 1 22 1 2 37 1 2 108 1 2 1 2 1 2 1 1 7 10 11 1 2 1 4 1 6 1 19 1 2 1 1 2 4 1 8 1 1 1 3 1 2 7 1 2 3 4 1 2 22 1 1 1 2 3 5 1 2 3 10 1 2 1 2 1 1 1 4 1 1 43 1 2 1 2 3 1 1 2 1 5 1 1 2 12 1 2 1 2 3 20 1 2 3 24 1 2 3 1 1 2 3 1 6 1 1 3 4 1 1 16 1 2 1 2 3 6 1 8 1 1 2 28 1 2 3 1 5 58 1 2 3 1 5 6 7 1 2 1 11 1 1 1 4 1 6 1 2 1 1 22 1 1 1 3 1 1 3 8 1 1 3 4 1 1 2 3 9 1 2 1 4 1 2 3 1 2 10 11 1 2 1 2 5 6 177 1 2 1 4 1 1 1 2 1 4 6 1 9 1 1 16 1 2 1 4 5 1 1 3 1 1 3 1 2 9 1 2 1 2 3 4 1 2 7 1 2 1 4 44 1 2 1 4 1 1 51 1 2 1 1 2 3 5 6 9 1 1 12 1 2 1 4 1 2 1 1 1 3 1 5 1 10 1 2 1 2 1 4 1 6 371 1 1 2 4 1 2 1 8 1 1 1…

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
Vigo's Teal Ledger - MEDIUM Coding Problem | CodeTikki