CT43938

Last ledgers of Quill

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

The assayer Quill has been asked to reconcile two mismatched ledgers. On the desk lies a long table of ledgers 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: 875 155088900 411101947 433795155 246786750 248627015 601729557 848137697 117956650 853767593 833281170 338305719 564240395 937847667 580314203 769036733 850204176 551155336 587306583 704148090 207237565 683315016 698256426 917074011 638294657 201926162 525949541 367532257 455207320 443807156 419366134 847130775 237113232 437366421 455310761 185770459 276390602 793308777 904912191 540877559 91972725 296779095 496162481 595507412 702377084 238461765 679101867 169076105 774848278 659948714 411215858 262482272 414757447 705154941 294950769 783170872 34665818 123511269 94598977 911080622 833603754 27509206 525434850 798401715 43741886 262419832 315939584 364861436 531465287 126794640 38614114 111721447 321552511 930089749 144672858 658284386 965664182 681360481 611219532 715995456 233549917 44…
Output: 1 2 3 1 2 6 7 1 9 1 1 2 13 1 2 3 1 2 3 1 2 3 10 1 1 2 1 2 1 1 8 1 2 3 1 2 6 15 1 1 2 3 5 6 1 2 1 10 1 1 1 3 5 1 17 1 2 1 36 1 1 2 3 1 2 3 4 5 1 1 2 4 60 1 2 76 1 1 3 1 2 6 1 1 3 4 5 1 13 1 1 3 4 1 2 1 1 1 6 1 1 3 1 11 1 1 3 1 2 3 1 8 1 1 3 23 24 1 2 1 4 5 1 1 3 1 1 3 1 8 1 10 1 1 13 1 2 1 4 5 52 1 2 1 1 5 1 2 1 4 1 1 3 4 1 6 16 1 1 2 1 2 5 1 1 3 91 1 2 1 2 1 2 7 1 1 3 178 1 1 1 2 1 6 1 2 9 1 1 3 1 5 1 2 1 4 10 1 2 3 14 1 2 3 1 5 1 2 1 9 33 1 2 3 1 2 6 1 2 3 1 1 6 1 1 1 3 1 1 13 1 2 1 1 5 1 1 2 3 1 1 12 1 2 1 1 2 1 4 1 2 1 9 1 13 1 40 1 2 1 1 3 1 7 1 2 1 90 1 2 3 1 5 1 1 3 4 1 1 7 1 1 105 1 1 3 4 1 2 1 291 1 1 3 1 2 1 2 1 6 1 2 12 1 1 3 1 2 6 310 1 2 1 2 1 4 5 1 1 1 3 4 1 1 3 4 10 1 1 2 1 5 1 7 1 1 2 1 5 1 2 1 26 1 2 3 1 2 1 38 1 1 3 1 5 1 2 3 9 1 1 3 1 1 1 7 57 1 1 1 4 5 1 2 1 1 1 3 1 1 3 …

Example 2:

Input: 549 384380129 378536230 642246055 287931453 556801098 544806508 313665766 637016664 707375120 625446039 646468767 278120980 445294905 688105003 197696079 605159298 943371597 664597117 173108294 343366377 609521315 143006738 121966950 215036949 581341955 559499858 64231604 81003130 57833463 135100550 73915918 394722452 662066270 138789472 128248738 892767023 510655471 24122954 386825597 311202456 758230557 214244104 168566210 253949388 546783298 202797245 135611811 92803641 273190473 458250650 173504888 275629792 958197076 550347998 129409806 223038519 627468689 919789316 224495012 912986608 995529213 636634812 729326642 986426431 176200533 175285999 391685986 81364715 953323391 777825722 416803318 137828499 979544062 426588971 307522336 535847473 769015207 684958857 548463672 179127567 228…
Output: 1 1 3 1 2 1 1 5 9 1 2 1 2 5 1 2 17 1 1 2 3 1 1 3 4 1 1 2 1 4 1 6 15 1 1 19 1 1 2 1 5 1 1 3 4 1 1 1 4 5 1 2 53 1 1 2 4 5 1 2 61 1 2 3 1 1 3 1 5 1 1 1 9 1 1 3 4 1 1 1 2 5 1 2 1 2 1 2 28 1 2 3 4 1 1 1 1 1 2 7 1 9 1 2 3 1 1 1 7 1 22 1 1 1 4 1 1 2 1 9 1 2 12 1 1 1 2 17 1 1 20 1 1 2 3 1 6 1 1 2 1 4 5 1 1 9 1 1 2 13 1 2 1 1 3 6 26 1 1 2 1 1 5 53 1 2 3 1 1 6 1 2 1 1 2 3 5 14 1 1 2 1 5 6 1 1 9 1 2 3 1 5 6 1 2 1 2 109 1 2 1 1 1 1 7 1 2 1 4 1 2 7 1 1 3 1 1 2 1 5 16 1 1 3 4 1 2 1 2 1 1 3 1 9 1 1 2 1 41 1 1 1 1 4 1 2 1 2 5 10 1 12 1 2 1 4 1 2 1 1 2 1 7 1 1 10 15 1 2 3 210 1 2 1 1 1 4 1 2 7 1 2 1 11 1 13 1 17 1 1 3 4 5 294 1 1 1 2 5 6 1 1 3 1 2 3 13 1 1 1 4 1 1 2 8 1 1 3 1 1 2 1 1 9 1 1 3 1 2 1 4 5 6 1 1 1 30 1 2 1 4 1 49 1 1 2 3 1 5 1 2 8 1 1 2 1 14 1 2 1 1 19 1 1 3 1 5 1 2 1 4 1 2 3 1 2 6 1 12 1 1 39 …

Example 3:

Input: 1720 621684584 952784761 227564828 735551094 674661754 650494550 770319077 64080327 317901575 967456397 875216005 826502514 97404040 134405669 406569429 131191753 324747755 769416207 220097498 939923886 879141030 800055065 465351870 772774354 428464514 555029662 584569293 855401688 667681881 807300207 323832981 722943117 667657586 571309205 224555446 645691678 630575332 487107365 154653687 622391823 557169338 929425863 38090316 934082403 789344549 55568030 138421950 453767904 312055539 464639241 7914859 564558235 505582276 504413448 827049473 237834497 518700213 726250833 851384398 649666663 933132602 504832661 633632231 67754180 669065199 276505135 717523093 346289378 720827035 59532201 551254160 548207450 52300313 150340118 467014401 747181833 611839934 846836773 658477164 712313925 6987…
Output: 1 2 1 2 1 1 5 1 2 10 1 1 1 2 3 1 2 6 1 10 1 1 1 2 1 2 3 7 1 2 1 2 1 1 1 3 1 1 1 3 1 22 1 24 1 1 2 3 1 5 1 7 1 1 11 1 2 3 15 1 17 1 2 1 4 1 6 1 8 1 2 1 1 2 3 15 1 17 1 2 1 4 1 2 1 1 77 1 2 3 1 1 1 4 1 1 1 2 3 4 11 102 1 2 1 1 2 1 5 1 1 1 1 3 6 1 2 3 1 11 1 2 3 1 2 1 2 3 1 7 1 2 3 4 15 1 2 1 1 5 32 1 2 1 145 1 1 1 4 1 1 1 1 3 4 1 1 8 9 1 1 13 1 2 1 2 1 1 3 6 1 2 1 2 30 1 1 3 179 1 2 1 1 3 1 1 2 7 1 1 12 1 1 3 1 1 1 2 3 1 10 1 2 1 26 1 2 1 2 3 4 5 1 2 3 1 12 13 1 1 3 1 2 45 46 47 1 2 1 2 3 1 2 1 1 3 9 12 1 2 3 4 1 1 2 1 4 1 1 2 1 1 2 12 1 1 1 3 1 22 1 1 3 1 1 1 1 8 1 1 1 1 3 1 5 1 8 1 2 3 1 1 3 1 1 3 10 28 1 1 2 3 1 1 6 1 59 1 1 1 4 1 1 1 4 1 1 82 1 2 3 1 5 1 1 2 1 5 1 12 1 1 1 2 5 1 2 1 9 1 1 2 4 1 1 7 1 1 1 1 1 163 1 2 1 1 2 3 5 1 2 1 4 1 2 14 1 2 1 2 19 1 1 3 1 1 2 1 2 1 4 1 2 1 2 5 1 2 3 …

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
Last ledgers of Quill - MEDIUM Coding Problem | CodeTikki