CT39968

The registers Streak Back Puzzle

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Xanthe the auditor watches over the port of Emberfall's stores of registers. A careful computation stands between order and chaos. 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: 3293 780763468 152008777 11703007 887676744 162713866 930208783 796653297 516880200 967773752 78169453 318282356 666207584 500659161 139791536 369025625 703092503 402378931 679470383 882443487 991073925 751805038 607256620 156143559 726982842 806919947 919754395 663501703 870898838 519018091 555256214 63059419 643492563 975594374 49223925 261718357 508715860 323725733 448998931 663794555 312490597 175983190 360204495 817085197 295300009 720018181 465526308 905896929 614440858 95951134 899991715 602196753 32908585 616101363 917906478 283694462 368799820 838750277 387687989 60847967 201959874 489534880 12701690 126614541 911096426 170687753 463812829 169268517 372562887 489510097 182737807 47233823 748960674 648211095 368624118 445454253 540980906 846617528 59662093 877190075 669293294 13256…
Output: 1 1 1 4 1 6 1 1 9 1 2 3 1 1 2 7 1 2 10 20 1 1 1 3 5 6 1 2 1 2 1 4 13 1 2 3 1 2 6 1 1 3 10 1 2 1 14 1 1 3 1 1 3 21 1 2 3 1 1 2 4 1 2 10 1 2 1 2 5 1 1 8 1 1 2 3 13 1 15 1 1 62 1 2 3 1 5 1 2 1 4 1 2 1 2 5 10 1 1 2 14 1 1 2 4 1 1 1 1 4 6 1 2 32 1 1 2 1 2 3 7 122 1 1 2 1 1 6 1 2 1 1 3 1 1 8 1 1 17 1 1 1 3 22 1 2 1 2 3 1 2 1 4 10 11 1 1 3 1 1 39 1 2 1 4 1 2 3 1 170 1 1 1 1 4 1 2 8 1 2 1 1 2 1 1 3 1 1 1 3 1 5 12 1 2 1 4 1 1 2 1 1 10 1 35 1 1 2 1 5 1 1 3 1 1 1 12 1 2 1 4 1 1 7 1 1 3 4 1 1 3 1 5 6 1 1 67 1 2 3 4 1 1 1 1 5 1 2 12 1 1 1 1 17 1 2 20 1 2 1 2 1 2 7 1 2 10 1 1 2 4 35 1 1 3 1 2 3 1 2 3 1 11 1 2 1 1 2 3 4 1 1 3 8 1 2 1 26 1 2 1 2 3 1 7 1 1 10 1 2 3 1 5 1 1 1 19 1 1 2 4 1 6 1 1 1 3 5 6 1 1 15 1 1 3 4 1 2 1 4 5 10 1 12 1 2 1 1 5 1 7 1 1 2 1 12 1 1 3 28 1 2 1 2 1 1 35 1 1 2 4 1 1 7 1 59 1 2 3…

Example 2:

Input: 567 736907879 712366359 137659382 391361691 245103220 415085080 189135094 859874996 988829223 431543345 284831026 380570190 811188281 213465519 672296749 484118867 157965048 227402752 263762812 947746953 502920744 271840778 930090988 689731306 954637962 280425493 626157425 978353315 706042176 270397917 42594175 499834498 94743685 350558889 653273368 334379459 26869064 452143209 581605375 783950815 860959420 554624035 388395469 391797209 50868538 438327941 280697063 791077890 881238739 231840602 638096872 766589827 230244396 589115639 44488242 361336322 917417285 753294568 495520085 173630654 308016032 840176166 950054821 114295524 900840079 442615879 503554886 490144382 831729121 852958055 916920043 189452769 203311785 238436040 590366306 965708830 275343208 715041501 911817271 340958802 2…
Output: 1 1 1 2 1 4 1 8 9 1 1 2 4 1 2 1 1 2 3 11 1 1 3 1 16 1 2 19 1 1 1 3 1 2 6 1 1 3 4 12 13 1 1 2 1 4 1 7 21 1 2 3 1 2 1 2 29 1 1 1 2 5 35 1 2 1 2 1 4 5 8 1 2 3 4 48 1 2 3 1 1 3 4 1 1 3 1 2 6 1 2 1 1 2 6 1 1 3 1 17 1 2 24 1 2 27 1 2 1 4 5 1 7 1 9 1 1 3 4 111 1 1 1 2 1 4 1 2 129 1 1 2 4 1 1 1 8 1 2 1 4 5 1 2 1 2 5 11 1 1 3 1 1 6 1 2 3 4 1 1 1 4 5 1 2 1 1 1 6 1 1 18 1 20 1 2 1 4 1 26 1 1 2 1 4 6 1 1 9 1 2 3 1 40 1 67 1 2 3 1 1 3 1 5 6 1 8 1 2 1 15 1 2 3 1 2 3 1 2 1 10 1 1 13 1 1 1 4 1 1 3 8 1 2 3 1 1 14 1 2 3 1 5 1 7 8 1 1 2 4 5 1 1 8 1 10 1 12 1 1 3 16 17 1 19 1 1 3 31 1 2 1 2 5 1 1 3 1 1 3 1 5 1 1 2 12 1 2 1 1 2 1 7 1 2 1 1 2 1 1 1 9 17 35 1 1 3 1 2 3 4 5 1 10 1 12 13 1 15 1 1 2 1 1 1 3 1 1 2 11 1 94 1 2 1 1 5 1 1 3 1 1 2 148 1 1 1 2 3 1 2 1 2 5 1 11 1 2 14 1 1 1 1 4 1 21 1 1 3 1 2 3 1 1 6 1 1 …

Example 3:

Input: 3954 708034430 590140358 549675918 134303792 716097666 434933597 541432911 509492691 713736037 999815300 102893395 685627972 345481620 985208173 139022698 705120056 886815351 800796351 820639966 607039317 58373444 681248490 590078420 621850891 509634632 352404445 358443834 671611473 879687238 500158093 510847971 535729881 828341330 982169309 16710255 640434047 375376293 615307060 742684914 76529675 891019485 571767348 78860930 282679449 58223953 297904555 365363217 438476949 214213302 677288137 559076003 307642443 669676342 613692830 746515939 277920130 539849080 62506006 274990247 880476762 344001774 299855349 342119737 732772036 419458635 560135256 950326926 197375047 137478439 673909878 421594010 467957417 517335836 564055537 396407418 719965393 472562552 669606739 358188844 428813980 4…
Output: 1 1 1 1 5 1 2 1 4 10 1 2 1 4 1 2 3 1 2 1 1 3 1 2 1 1 2 6 12 1 2 3 4 20 1 2 1 2 5 1 7 1 1 2 1 4 5 6 1 9 1 1 3 1 14 1 2 1 2 19 1 1 2 4 1 2 33 1 1 3 1 2 3 4 1 9 1 2 1 2 3 1 2 17 1 1 53 1 1 3 4 1 1 1 4 1 2 1 2 1 4 68 1 2 1 1 3 6 1 2 1 1 2 1 5 1 1 8 85 1 1 1 4 1 2 3 4 1 6 1 1 2 4 5 1 7 8 1 1 1 3 1 1 7 1 1 24 1 1 1 1 1 2 4 1 1 2 11 1 13 1 2 16 1 1 1 3 5 1 7 8 1 2 3 12 1 1 3 1 1 1 4 1 1 2 8 1 2 1 2 1 6 1 16 1 1 187 1 2 1 1 5 1 1 3 1 1 6 1 8 1 1 3 4 18 1 2 3 4 1 2 3 1 9 1 1 2 4 1 2 3 1 18 1 2 1 2 1 4 1 1 27 1 2 1 2 1 6 1 1 1 2 3 5 1 1 15 1 62 1 1 1 2 1 2 3 6 9 1 11 1 1 1 2 1 6 1 1 1 1 11 1 1 1 1 3 1 2 279 1 1 3 1 1 3 1 1 6 1 2 1 1 5 1 2 3 1 2 6 1 22 1 2 1 2 5 1 2 1 2 5 1 1 3 1 2 1 2 1 1 15 1 1 18 1 1 1 4 1 2 7 1 9 10 335 1 1 1 1 2 1 5 1 2 3 4 1 11 1 2 16 1 2 1 1 1 6 1 2 1 2 1 1 1 6 1 10 1 34 1 2 1…

Constraints:

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

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