CT43968

Rohan's signals Reckoning

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

In the galleon yard of Masthead, Rohan the registry keeper keeps careful count of the signals. Decode the foreman's shorthand notes, 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: 2202 438497133 454064110 975744395 25823502 895766650 172889281 202501816 815997738 186240796 524779559 753161398 953055697 326767547 347470798 166819499 305203546 711922490 296828437 639227964 23930555 577300241 734864296 146437153 2785522 600012568 289406776 553864323 116211514 196414976 853325610 503647357 139825394 651440293 347941977 389023570 494266788 973392205 933390886 632170821 69564203 185791308 263078768 929584200 642606148 575973622 342762807 454276720 512120354 683607163 412238395 422399606 994192556 501899306 251407825 760366428 770123053 126469942 299829557 540223128 745391456 600835092 774317715 613318937 55735152 704121378 211570126 619181294 162494044 383982061 630850567 327949039 154669912 101252978 815184554 194255771 618747477 480988805 263325907 277380941 933123245 6…
Output: 1 2 3 1 2 1 2 3 1 2 3 9 1 2 1 2 5 1 2 1 2 10 1 1 3 1 2 1 2 18 1 1 3 1 2 3 34 1 1 1 2 3 5 1 1 1 2 3 6 1 2 52 1 1 3 4 1 2 3 4 1 10 1 1 3 1 2 1 2 5 1 1 1 22 1 2 1 1 2 28 1 2 1 2 3 4 1 36 1 1 1 2 1 6 1 2 3 4 11 1 49 1 2 1 2 5 1 1 3 1 1 2 3 5 1 1 65 1 2 1 4 1 1 2 3 1 6 1 1 3 10 1 16 1 1 3 20 138 1 1 1 3 4 1 7 1 1 3 1 1 1 2 4 1 1 1 19 1 1 2 1 5 1 1 27 28 1 2 3 32 1 1 3 1 5 1 7 1 2 1 2 1 1 1 2 3 6 1 1 11 1 1 1 1 4 1 2 3 1 2 10 64 1 2 3 4 1 2 3 1 5 1 2 1 9 1 15 1 1 18 1 2 21 1 2 3 4 1 1 2 1 9 1 1 3 1 1 1 4 1 1 2 1 2 1 4 7 13 1 2 3 1 1 2 1 2 1 4 57 1 1 3 1 1 2 1 8 1 2 11 12 272 1 1 3 1 5 1 1 1 2 10 1 2 1 2 1 2 1 2 5 1 7 1 1 1 2 12 1 2 1 20 1 2 23 1 2 1 1 38 1 1 1 42 1 1 1 2 1 2 6 1 2 52 1 2 3 1 2 3 1 2 1 2 8 1 2 3 4 1 17 1 1 20 1 2 3 1 2 1 1 1 6 7 1 1 3 1 5 6 7 1 1 17 1 2 23 1 2 1 2 1 2 3 8 1 10 1 …

Example 2:

Input: 1399 130924923 45179429 900575939 417762301 994398018 800397462 780163442 514065080 428737322 485801657 138045532 818634708 193295296 669833888 22889807 13253294 92543397 213210034 691860502 154324306 915313024 130759329 551420420 28771524 570558344 448640165 194759661 999740282 268683912 750598176 302919459 561416159 935698851 987141941 201901720 253095553 213098948 854354711 723001255 830941968 977201340 764162072 197888154 891442583 791203630 524148319 825342064 249906204 911130740 889737756 426310596 539251438 339044966 235694277 874468141 995305532 226987854 794682165 280930860 756830008 661775969 306798852 169884056 338783198 739950055 68157055 515458423 475141279 777014230 416194551 715883326 297834410 651168751 223090114 576503035 564783441 593650676 716968363 810561960 590275853 7…
Output: 1 1 3 1 5 1 1 1 1 2 1 7 1 2 1 1 3 4 7 1 16 1 2 1 4 1 1 28 1 2 1 2 5 6 1 2 1 4 1 2 7 1 1 3 1 1 3 1 8 1 1 2 1 1 5 28 1 2 1 2 1 1 1 3 5 1 2 1 11 1 2 1 2 1 2 1 4 9 23 1 2 1 27 1 1 1 1 4 33 1 1 1 2 3 1 7 1 1 2 3 1 5 75 1 2 1 4 1 1 2 1 84 1 1 1 1 5 1 7 1 2 10 1 2 1 14 1 1 2 1 2 6 7 1 2 1 1 5 6 14 1 2 1 1 5 1 2 3 1 2 6 12 13 1 1 1 1 5 1 2 1 2 1 11 25 1 2 1 2 3 31 1 1 2 1 5 1 7 1 1 3 4 1 1 1 2 1 17 1 2 1 4 1 2 1 2 1 1 7 1 2 3 1 2 13 1 1 2 1 39 1 2 1 1 1 6 1 2 3 1 50 1 1 1 4 1 6 1 2 9 1 2 1 4 1 2 1 1 3 6 11 1 2 1 1 3 1 136 1 2 1 2 1 2 1 4 7 1 2 3 1 1 3 1 1 238 1 2 1 2 1 2 1 1 7 1 2 1 13 1 1 3 1 2 19 1 2 1 2 3 6 1 8 1 1 2 1 5 1 2 1 2 10 1 1 2 22 1 1 2 3 5 1 7 1 1 1 11 1 1 293 1 1 3 4 1 1 7 1 1 10 11 1 1 1 3 1 2 7 1 1 1 4 1 1 3 1 1 1 7 1 1 1 22 1 2 1 4 1 2 1 2 1 1 5 1 7 1 48 1 2 1 4 1 54 1 2 1 4 1 2 …

Example 3:

Input: 1915 820916261 256205210 142603745 93920489 987844976 976313464 757735033 611868760 194473405 798695195 993351387 352051608 6247574 495539551 145226 862310969 716536514 690422434 104691931 28875733 539987976 999606858 585615414 705872580 812715804 228630471 594347170 460302057 393259142 353174402 207529640 595377210 28686989 77998270 365898704 484879641 954298910 908761498 592266516 750666113 769453428 929601498 322459096 982333827 576213086 141944060 680743524 488884260 928812984 810689622 200339566 970334270 9068523 758457483 327488938 76413667 851811171 597194906 595412693 918297979 683365564 925533745 345350580 56141471 857285352 880074487 741075971 36796909 212708197 143942864 101945899 674808176 979023250 272276621 64161415 139520159 898055399 543651908 297920080 669577865 383579412 …
Output: 1 1 1 1 5 1 1 1 1 4 11 1 1 3 1 5 1 1 1 1 3 22 1 2 3 1 2 1 1 1 1 7 1 2 3 4 15 1 1 2 3 5 1 22 1 1 3 1 5 1 1 8 1 2 1 1 5 1 1 8 1 10 1 1 3 4 1 1 2 1 1 5 29 1 1 2 4 1 1 3 1 1 10 1 2 13 1 1 3 4 5 6 7 1 1 1 1 4 1 1 1 8 1 1 3 1 1 6 1 2 25 1 1 2 1 2 5 1 2 8 1 36 1 2 1 40 1 1 2 1 1 3 1 8 1 1 2 4 5 6 119 1 1 3 1 5 1 7 1 9 10 11 1 1 1 1 2 1 7 1 1 2 1 2 5 1 1 1 1 3 30 1 1 3 4 5 1 7 1 2 1 4 1 2 14 15 1 1 2 3 5 6 1 2 3 1 2 3 1 5 6 16 1 2 1 20 1 2 1 4 1 2 3 1 44 1 2 3 1 1 1 51 1 1 3 1 1 1 4 1 9 1 1 1 1 4 1 2 3 9 1 2 1 4 1 2 1 107 1 2 1 1 5 232 1 1 1 4 1 2 3 8 1 242 1 2 1 2 1 4 1 2 1 2 1 2 1 2 1 2 11 1 1 2 1 1 3 6 1 8 1 2 3 30 1 1 1 4 5 1 2 3 1 10 1 1 2 1 15 1 17 1 2 1 1 3 1 1 3 7 1 2 1 1 3 4 14 1 1 2 1 21 1 2 1 4 43 1 2 3 4 1 2 1 2 9 1 2 12 1 1 2 1 2 1 6 20 1 2 1 2 1 1 3 1 2 3 1 2 13 1 2 1 1 3 4 5 1 2 3 1…

Constraints:

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

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