CT47469

Cressida's Whispering marks

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

The inventory keeper Cressida has been asked to reorganize the archive shelves. On the desk lies a long table of marks readings. 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: 588 449893837 678952884 443249900 577283907 874414327 844376384 325586800 843747715 234029432 939206389 389882086 224856124 154699477 330418789 952106007 175073141 281557773 651251290 93415982 237181265 894245163 240850636 692908868 315858907 513347906 98080721 948765925 961454526 670919097 402580953 272206326 451509366 327084119 254389973 216389804 548462885 555621904 279228113 654183434 737583655 412071491 397549295 146553896 802643191 462038557 819390644 759347001 64944691 214578779 171048567 586201152 822221152 302107623 217884137 73095106 353424798 47688867 408742011 881357885 57926064 715759454 835160712 628956046 213311343 822829612 304756589 194704268 927011676 115683028 205978849 641453527 267698250 7954713 197365189 126901451 573179906 672705492 567680988 117283511 812172989 4042…
Output: 1 2 1 2 5 1 1 2 1 10 1 1 1 3 15 1 2 3 1 2 6 1 2 1 2 1 12 28 1 1 1 3 1 1 1 7 8 1 10 12 1 1 1 16 1 18 1 1 2 1 4 24 1 1 1 4 1 6 31 1 2 3 1 1 3 1 1 40 1 2 3 1 1 2 1 5 9 1 1 12 1 1 15 1 1 18 1 2 3 1 2 1 65 1 1 96 1 1 3 1 2 1 4 1 2 1 2 1 1 2 8 1 1 3 4 1 14 22 1 2 1 2 1 2 1 2 1 4 9 1 2 1 37 1 2 3 1 2 3 4 1 2 1 11 1 2 3 1 5 1 1 2 1 4 1 1 24 1 1 2 1 2 1 1 5 1 10 1 1 3 1 1 1 1 1 3 7 1 1 13 1 1 1 4 52 1 1 1 1 1 3 6 7 1 10 1 2 3 103 1 2 1 1 3 4 1 2 3 8 1 12 1 2 3 1 2 1 1 2 6 7 8 1 2 3 1 5 1 1 2 9 18 1 1 1 4 1 1 2 8 1 43 1 1 1 3 5 1 1 2 1 1 2 7 1 1 2 1 1 18 62 1 1 1 2 1 6 1 1 2 4 1 1 7 1 9 1 1 1 3 1 1 6 23 1 1 26 1 2 1 2 1 2 5 1 2 3 1 2 1 1 2 1 1 44 1 2 47 1 2 3 51 1 2 1 4 1 1 3 4 1 6 1 12 1 1 2 4 1 6 1 1 3 1 1 3 4 1 2 3 1 18 1 2 3 4 1 1 3 1 2 3 1 2 3 1 261 1 2 1 2 3 4 1 2 1 4 5 10 11 12 1 2 1 4 1 1 1 …

Example 2:

Input: 2060 233860436 155498800 837765809 598528800 652437019 97209823 205077256 746450319 230395520 670573005 716442091 351260481 366855318 277738464 195757537 518470608 65211675 283874818 312568399 286427865 361531631 25706525 632670320 63020350 331730925 818689625 512396883 580205837 281024109 970966074 193504288 955635324 886540758 703729946 782301245 703338425 705093319 120383599 743267547 587206003 327722905 609780605 420797908 231120779 405231708 123553680 810413229 822217389 476323123 648106276 476169425 701722972 530281629 439710486 91428175 996156917 811283483 375152305 642100654 602155597 382798783 507803800 366341954 665944609 319285275 307794951 922906983 945291121 234397043 598687916 378856079 314808209 592360094 314730478 701766026 422176165 983714461 883222099 142487796 853592032 …
Output: 1 1 3 1 2 1 2 5 1 2 3 1 2 1 1 5 1 2 3 1 5 1 12 1 2 23 1 2 1 30 1 2 1 1 2 1 2 1 4 1 1 3 1 1 2 1 14 15 1 2 1 4 1 1 1 56 1 1 2 1 1 2 1 7 1 1 11 12 1 2 1 1 3 1 7 1 21 1 1 2 1 1 3 7 1 2 1 2 1 1 3 1 2 38 1 2 1 4 1 6 1 2 1 1 2 1 4 8 1 2 1 2 5 1 2 1 2 18 1 1 2 4 1 30 1 1 1 1 5 1 2 38 1 2 3 1 1 6 1 2 3 1 2 1 1 1 2 1 2 6 13 14 15 1 1 2 4 5 1 7 29 1 69 1 1 3 1 1 3 1 1 2 4 1 1 1 1 2 6 1 2 16 1 1 1 4 1 1 2 4 1 2 1 1 2 1 4 6 1 1 9 1 13 1 2 1 2 1 4 5 1 7 1 1 25 1 27 1 2 1 1 3 1 1 2 1 4 1 2 7 1 2 43 52 1 73 1 1 3 4 1 2 1 1 9 1 1 1 2 4 1 1 7 1 161 1 1 3 1 1 6 1 1 1 2 5 1 7 14 1 2 1 1 1 4 1 1 2 1 4 1 1 3 1 5 1 18 1 1 3 4 5 1 1 2 9 1 2 1 13 1 2 1 1 2 4 1 1 1 1 1 6 1 1 3 14 1 2 1 2 1 2 36 37 1 2 1 41 1 1 3 1 1 2 3 1 5 10 1 1 2 4 1 2 7 1 1 1 349 1 2 1 2 1 2 1 6 7 1 11 1 2 1 4 5 1 1 2 4 1 6 1 1 3 1 2 3 1 1 6 7 …

Example 3:

Input: 2253 690432413 558192107 557075991 312458932 667302443 588735713 396105972 967551724 679379614 910898112 331822902 905213746 122641230 813856991 211088412 445190892 340095837 375348373 541086224 833546004 579534305 333976743 319990331 14699673 692709624 432238588 547302715 475640370 190101694 183509787 549991450 937483083 950401297 579077802 58932462 701058131 764984634 880937132 344010815 44475731 888619543 174913219 565174165 940375651 74432322 335768672 304718731 847782068 918966562 314920361 480484282 228493992 778737045 976776567 985285568 452746588 249846817 100993133 349964581 278048515 861127969 234587249 854917479 471244545 1326542 723156221 137978750 800468321 302296068 792660830 71251107 185442148 694743116 703808305 343168149 674900118 520534304 18379281 616743211 528632962 404…
Output: 1 1 1 1 4 1 1 8 1 2 1 2 1 2 1 2 1 2 5 8 1 1 1 1 5 1 2 1 1 1 6 24 25 1 1 3 4 5 1 1 8 1 2 11 1 2 1 4 5 1 2 1 4 54 55 1 1 1 3 1 6 1 2 1 1 3 1 5 1 2 1 2 3 4 1 2 1 1 3 1 1 3 1 1 2 7 1 1 3 4 28 1 1 1 2 4 36 43 1 2 1 4 1 2 1 8 1 2 3 1 1 1 3 1 2 3 19 1 2 1 4 1 2 1 2 3 6 1 2 9 1 1 1 3 1 2 3 1 1 1 1 25 1 1 1 2 5 1 7 33 1 1 3 4 1 6 1 1 1 4 1 12 1 2 1 16 1 1 3 1 2 1 2 1 4 5 11 1 1 63 1 2 1 2 3 186 1 1 1 4 1 1 3 4 1 2 3 1 1 2 7 1 1 1 3 1 17 18 1 2 3 1 5 1 1 8 1 2 3 12 1 1 3 1 5 1 2 20 21 1 1 2 1 2 1 7 1 2 1 4 51 1 2 3 1 2 3 1 1 64 1 2 1 2 3 4 5 1 2 8 1 2 1 1 1 3 7 1 1 3 4 1 1 24 1 2 1 2 1 2 1 96 1 1 3 4 5 1 1 1 1 1 5 1 2 8 1 2 113 1 2 1 2 3 1 2 1 1 8 9 1 1 14 1 2 1 18 19 1 2 3 1 2 1 4 1 1 3 1 2 6 7 1 2 10 18 19 1 1 2 4 1 2 7 1 1 1 4 1 1 3 8 1 1 1 2 1 1 15 1 1 1 3 5 1 2 68 1 1 71 1 2 1 4 76 1 2 1 1 5 1 …

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
Cressida's Whispering marks - MEDIUM Coding Problem | CodeTikki