CT38041

The Brass Streak Back

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Deep in the fox den of Rustwood, Hema studies rows of marks entries. One clean number will settle the guild's oldest argument. 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: 2837 650313810 311367680 393646177 71960728 572811479 992494598 45199589 214742107 48307678 320876166 345840004 601159277 5583314 421429637 271694297 150384407 122108217 393633081 901947414 542714601 917467753 730788716 423015238 438689019 129100309 770171016 273527345 201202494 92948167 531745963 424735340 444217171 982815480 815451942 517612473 606903458 180794544 375627577 591225327 187632358 111840785 723027760 939225180 877514747 952760319 772532410 590089563 239887362 275232545 580128698 535590383 236975448 925213214 382966265 492077757 681762582 99663753 976921385 234100819 353989068 390836150 988519324 256689185 310092396 572361305 810824053 652035396 983591770 917264261 696180936 657544785 841053027 846013700 50142282 102924209 210512929 806798813 920344055 947783650 390012899 633…
Output: 1 1 2 1 4 6 1 2 1 4 5 6 1 2 1 1 1 4 13 1 15 1 1 2 1 5 1 1 1 4 1 2 27 1 1 2 1 2 3 1 1 8 10 1 12 1 1 1 2 3 1 1 8 1 2 3 1 25 1 2 3 56 1 2 3 4 1 6 1 1 1 3 4 1 2 3 4 10 11 1 2 3 1 2 6 7 8 9 1 1 3 4 1 2 1 1 1 3 1 6 1 1 35 1 2 3 4 1 1 1 8 1 1 1 4 1 2 1 2 5 1 2 1 2 1 23 1 2 1 1 2 6 1 1 3 1 1 3 7 1 2 1 2 1 4 1 2 1 2 18 1 1 1 2 4 1 2 7 9 1 2 1 4 1 6 1 2 1 1 1 6 1 23 1 2 1 4 1 1 7 8 1 2 1 1 2 1 15 1 2 1 19 1 2 1 4 1 6 1 97 1 2 1 4 1 1 2 4 1 1 3 1 13 1 1 3 4 1 1 1 3 1 2 1 4 1 6 28 1 1 163 1 1 2 1 1 3 1 1 1 1 5 1 1 3 1 1 2 12 1 1 20 1 1 3 1 1 2 1 5 1 1 32 1 1 3 1 2 6 1 1 1 10 1 2 3 1 15 1 2 1 1 3 1 2 3 4 1 2 7 13 1 2 1 2 33 1 1 1 1 70 1 2 3 1 2 3 1 2 3 4 1 1 83 1 2 1 4 1 1 3 1 2 1 7 1 96 1 2 1 2 1 1 1 2 1 1 5 7 9 1 2 3 15 1 1 2 1 5 23 1 2 1 1 2 3 1 8 1 1 1 3 5 1 297 1 2 3 1 2 1 2 5 1 2 11 1 2 1 1 5 1 1…

Example 2:

Input: 3555 90122549 813098677 420073062 654553798 984759141 341313115 250174916 768188863 460037537 938852379 742936644 658152919 394205694 315608504 634626936 290254087 418748146 837474043 203177382 546111036 435754480 829735120 858752753 920064941 200008923 971647014 756840848 876762397 97619204 419246534 37078716 954852802 491400502 257679499 867457369 199974874 484611817 133434510 62197765 972182464 176465779 449573642 875154668 481834911 826665729 969742997 849295132 896662041 745870573 469389235 389155325 515612813 339087852 357117539 660119453 570073591 743818076 808106925 218259294 884006874 629232402 935881617 513246942 726574572 772164986 301619282 790239393 987828812 200588273 285787328 767284120 389026957 744892394 836221345 223628910 316917469 541326880 451884504 250447496 343685415…
Output: 1 2 1 2 5 1 1 3 1 5 1 1 1 1 3 1 2 8 1 2 1 4 13 14 1 21 1 2 1 2 1 6 1 1 3 1 2 1 1 35 1 2 3 1 2 6 1 2 1 1 1 3 1 2 6 1 8 10 1 12 1 16 1 2 3 1 5 68 1 2 3 1 2 6 1 2 3 1 1 2 1 1 3 1 1 2 4 14 1 1 2 1 4 1 21 28 1 1 31 1 1 1 35 1 2 3 4 1 2 1 2 1 2 7 1 2 14 50 1 1 3 1 1 2 3 4 1 1 2 1 4 10 1 1 3 14 1 2 3 4 1 2 1 4 9 1 1 3 4 1 2 3 4 1 1 2 1 5 10 15 1 2 18 1 47 1 1 1 2 3 1 2 7 1 1 58 1 1 2 3 1 2 1 8 1 2 1 1 5 1 2 1 2 1 1 7 8 9 10 1 1 202 1 2 1 2 5 1 1 2 1 5 1 1 3 1 1 16 1 220 1 2 1 1 1 6 1 1 9 1 1 2 1 4 1 16 1 1 3 1 2 6 1 2 3 10 1 2 1 4 1 2 7 1 2 3 1 1 3 1 5 1 1 8 1 2 3 12 1 14 1 2 1 2 1 4 41 1 1 2 1 5 1 1 2 1 4 1 1 1 14 1 1 1 4 5 1 1 8 1 2 1 4 1 2 15 1 1 3 1 5 6 1 8 1 2 1 4 1 2 1 4 1 2 1 8 13 1 1 3 4 1 2 1 2 5 1 2 1 104 1 1 1 2 1 1 3 6 1 2 9 1 1 1 4 1 1 1 2 1 6 1 1 22 129 1 2 3 1 5 1 7 1 2 3 1 1 1 2 5…

Example 3:

Input: 2688 28362359 299552388 665159445 69068745 881756513 236856777 610212381 745359702 776158930 544411455 699830762 13417272 131923775 673150514 233341330 486849349 667841369 774281239 572992128 350387937 335976137 407716196 369864186 594052786 899493716 261218107 42225527 378651984 606206820 788018225 96779465 841753327 193282537 835948159 849576261 506590461 934907942 566631109 325581722 761027230 756244790 298275138 294573824 950455776 711445 967659386 545171479 867472454 858693639 991576232 510929348 248182229 235188219 576723777 98590143 241613421 443033991 5382470 27219174 733192433 698924784 182101505 867019043 280974096 429691394 484557404 827681937 763678986 946738104 109215628 162793125 785703172 939946696 575903373 184055477 851076201 821147721 200459846 87239041 499740046 59723737…
Output: 1 2 3 1 5 1 2 3 4 1 2 1 2 3 1 2 3 9 1 1 1 3 1 6 25 1 1 3 4 5 1 7 1 2 10 1 37 1 1 3 1 1 1 44 1 46 1 2 1 50 1 1 1 4 1 2 3 1 2 10 1 1 13 1 2 3 4 1 19 1 2 3 4 1 1 3 1 1 1 3 4 5 33 1 2 1 1 3 1 2 41 1 1 2 1 1 97 1 2 1 1 3 1 1 3 7 1 2 1 4 1 1 2 1 2 1 2 3 1 5 11 1 1 14 1 1 21 1 2 1 1 2 4 5 1 2 1 2 1 1 14 1 2 1 1 3 147 1 1 3 1 1 3 1 5 1 7 1 2 1 2 5 6 1 2 16 1 1 1 1 3 5 1 1 3 4 1 31 1 2 34 1 2 3 1 1 2 1 1 9 1 1 1 1 3 1 2 1 9 1 2 1 1 1 1 5 6 1 2 1 2 3 4 5 1 1 10 11 1 1 3 1 1 6 24 1 2 1 2 1 84 1 1 2 1 4 5 1 1 9 1 2 1 1 2 15 1 2 1 2 1 4 1 23 1 1 3 4 1 1 1 3 5 1 11 1 2 1 1 16 1 1 1 2 5 1 2 1 1 49 1 2 1 2 1 4 1 2 1 2 1 10 1 2 3 1 2 3 1 1 3 4 1 6 1 2 15 26 1 2 1 4 5 1 2 1 4 1 1 3 4 1 15 1 2 1 2 5 6 1 23 1 2 1 27 1 1 1 57 1 1 62 1 1 3 1 5 1 1 2 1 1 5 1 1 3 4 10 1 1 3 1 1 3 1 1 20 1 2 1 1 2 4 1 1 2 35 1 2 1…

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.