CT46794

Qadir and the Prismatic marks

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

The auditor Qadir has been asked to price the new merchandise line. 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: 2216 631354062 521766297 178742177 970959801 632902314 130521532 647565912 541842994 972773757 273150938 760191036 435454356 131367890 941611897 637693865 335124717 604919985 687507516 109882753 350575557 282665979 92902911 12816192 40756360 303701738 409408247 208341838 872174408 192459903 75116366 942622555 10583285 834764770 728828854 535214110 294200833 537097184 938161988 744095409 320113046 481927597 212464231 796839026 785846677 786797150 823884494 486980132 188196344 96521984 334318177 989657038 657549579 907341478 87142594 750007714 978749398 466033253 947475225 293584299 975599835 581601252 290032943 289133356 700615312 753433111 619259187 378573202 250788095 144683020 214638499 716375211 734240524 156875476 989458812 776494937 413618915 372579375 857507185 392439533 703940872 38…
Output: 1 1 1 4 1 1 3 1 9 1 2 1 1 5 1 1 2 4 1 2 1 1 1 2 5 8 1 14 1 1 22 1 2 1 1 1 3 7 1 1 2 1 5 1 2 8 1 1 1 3 51 1 2 1 2 5 1 2 1 4 1 1 1 4 5 1 1 1 1 2 6 7 1 23 1 1 1 4 1 2 1 4 1 6 1 2 3 1 15 1 1 18 1 1 3 1 5 1 1 3 1 2 6 1 2 3 4 11 1 1 3 1 2 6 1 2 1 1 2 1 2 5 49 1 125 1 1 3 1 1 6 1 1 9 1 2 1 1 5 1 7 1 9 1 1 2 1 1 15 1 2 3 1 2 1 4 8 1 10 1 2 1 1 2 31 1 1 1 3 1 1 1 1 5 1 2 3 4 45 1 1 1 2 1 1 1 6 54 64 1 2 1 2 1 6 1 2 9 1 2 1 1 3 1 2 1 2 3 1 2 8 1 2 1 4 5 1 18 1 22 32 97 1 1 1 4 1 1 3 1 2 6 1 2 1 2 1 6 1 115 1 1 2 3 1 5 1 2 1 2 1 1 1 3 4 6 1 2 1 12 15 1 1 23 1 2 1 2 1 2 1 8 1 10 1 1 3 1 2 1 41 1 2 1 4 5 1 1 1 1 5 1 2 3 4 1 2 1 2 19 1 2 1 1 5 1 2 3 1 2 6 1 1 9 1 2 36 1 2 1 2 1 2 3 1 2 1 1 1 6 1 2 12 15 1 2 1 1 5 1 1 8 1 1 3 29 1 2 3 1 1 2 3 114 1 2 1 4 1 120 1 2 3 4 1 6 1 8 1 2 3 4 5 1 1 3 1 2 6 1 2 1 …

Example 2:

Input: 1508 780996802 105425652 364924443 713738104 433219707 707358023 744658098 934690531 995342292 286661614 193326979 788375496 142169825 91940587 510361072 445421435 623063387 334963455 768971602 11154066 7718655 684722532 636580389 12772929 125368305 86530720 55697947 933385768 910610007 592231582 144706398 727600204 62980750 763784011 857033046 532625035 98408248 459449764 793653564 86972567 932904565 66486472 621297364 226174264 471176537 45534156 938851184 4168288 42175982 710343332 359695648 59181274 923913196 916456038 152163880 210019054 346091528 243873995 180612738 890161619 297357075 761905577 65108207 496866030 695790728 554426931 418279098 943639918 974565411 517077642 153214747 46097768 866704039 906302586 344546940 699556249 755505338 576644670 270333044 981032749 495099776 110…
Output: 1 1 2 3 1 2 6 8 9 1 1 3 1 1 3 1 5 1 7 1 1 3 1 1 2 1 1 19 1 1 1 3 1 5 6 1 1 2 4 1 13 1 2 1 2 1 38 1 2 3 1 1 6 1 1 2 3 1 1 6 1 2 1 2 3 1 1 59 60 1 1 1 4 5 1 2 3 1 1 71 1 1 2 4 1 1 7 1 2 1 1 2 4 1 6 1 8 1 1 11 1 1 1 15 1 2 1 1 2 30 1 1 1 3 1 6 1 1 3 1 11 1 1 2 1 4 6 1 1 3 131 1 2 1 1 1 2 5 1 1 10 1 2 1 4 1 2 1 2 5 6 1 2 1 1 1 4 1 1 1 3 5 1 1 3 4 1 6 28 1 2 3 4 1 2 1 1 3 1 5 6 1 2 9 54 1 1 1 3 1 2 3 1 2 1 2 11 1 1 14 1 2 3 18 1 2 3 1 5 6 1 1 9 1 1 1 3 14 1 2 3 4 1 1 3 1 5 1 1 3 1 1 3 1 2 1 19 1 2 3 1 38 1 2 3 1 2 1 4 1 2 1 11 1 2 125 1 2 1 2 1 1 3 1 1 2 4 1 1 3 1 5 1 2 1 2 5 1 2 1 4 1 1 12 1 30 1 2 1 2 3 4 7 8 1 2 1 1 1 2 4 6 17 1 2 1 1 1 3 24 1 1 1 1 1 2 1 4 9 1 11 1 1 3 1 1 2 1 2 6 1 2 1 2 5 1 2 1 2 1 11 1 22 1 1 2 1 4 1 2 3 1 9 44 1 2 3 1 2 3 4 1 1 1 11 1 13 14 15 1 1 1 4 1 1 2 4 1 2 94 1 1…

Example 3:

Input: 3873 809412708 15690884 422347642 550493156 128809969 817228065 103886282 573494459 373936560 891796605 947940905 919497058 324038202 575958366 103476492 957340929 283879202 236495548 107529223 525841419 143484824 154761617 335047918 414765284 645296574 18430465 888002735 537929120 239923026 416683560 984584533 178657953 577633023 61521784 180872907 375848424 407960153 397343303 461888985 854845290 289017760 572677686 181198395 110144025 851999063 378200911 418470553 596923858 89296533 178113091 219158530 734148501 384416672 227041310 366500381 711085081 757581816 726075301 173157777 206779691 121760876 901845797 962480037 548319529 948693321 699772353 704010803 110458454 225186775 168858403 513845296 777557918 402000199 121304206 412422982 735029651 891979198 132242515 116454759 959964306…
Output: 1 1 2 3 1 6 1 2 1 10 11 1 1 2 1 16 1 1 1 4 1 2 3 4 9 1 11 1 1 2 31 1 2 1 2 3 4 1 6 9 1 2 1 1 5 1 2 3 1 2 3 7 1 1 2 4 12 1 1 2 1 31 32 1 2 1 2 1 2 1 4 7 1 1 3 4 12 1 1 17 1 1 2 3 1 2 1 4 1 1 1 3 13 1 2 3 1 5 1 2 3 1 10 1 2 26 1 2 1 2 3 1 2 1 1 5 1 2 3 9 1 2 12 16 1 1 1 3 4 1 6 101 1 2 1 4 1 1 2 3 141 1 2 1 4 1 1 3 8 9 1 1 1 2 5 15 1 1 1 3 1 1 3 1 2 10 1 1 1 29 1 1 2 3 1 6 1 1 3 4 1 1 13 1 2 1 4 1 1 1 2 9 1 24 1 2 1 2 3 1 2 6 1 1 2 3 4 1 39 1 2 1 72 1 1 1 3 4 1 6 1 81 1 1 2 3 1 6 1 1 2 1 4 6 1 2 1 16 1 2 19 1 1 2 3 24 1 1 2 3 1 6 1 2 3 1 1 36 1 1 1 1 5 1 2 1 4 1 1 1 3 4 15 1 2 3 1 2 1 2 1 9 1 1 12 1 1 15 1 2 3 1 1 1 2 74 1 1 3 1 2 6 81 1 1 2 4 1 2 1 1 2 6 11 1 2 1 15 1 2 3 1 1 3 1 5 9 1 1 12 1 1 3 1 2 1 2 1 1 7 38 1 2 3 4 1 1 2 4 1 10 1 353 1 2 3 1 1 1 2 8 1 2 1 2 3 14 1 2 3 1 2 1 2 1 1 2 1 …

Constraints:

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

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