We will hold AtCoder Regular Contest 130.

- Contest URL: https://atcoder.jp/contests/arc130
- Start Time: http://www.timeanddate.com/worldclock/fixedtime.html?iso=20211128T2100&p1=248
- Duration: 120 minutes
- Number of Tasks: 6
- Writer: maspy
- Tester: HIR180, tempura0224
- Rated range: — 2799

The point values will be 300-400-500-600-800-1000.

We are looking forward to your participation!

Good luck on this round!

It will be very hard.(as usual)

It is really hard to solve the problems!

`If it exists, print the lexicographically smallest among such sequences A, in one line, with spaces in between.`

WHAAAYYY???

First blood on E!

I'm surprised it got so few solutions. I just noticed that if we pick the last point where minimum increased (possibly before the first or after the last operation), then there's an obvious minimum sequence given by the maximum number of occurrences of any number in the input sequence before that point, and simulating validity when moving that point is sort of bruteforce-y.

Can anyone explain D to me in simple? I don't get the editorial :(

It may be useful to read this first: Combining subtrees

Yesterday, I always thought that I was greedy when I wrote C. Then I finally found out that wa had a point. Later, I found that there might be a carry option at this point, but we became 9, which made it impossible to carry. Then, there was no carry in 9, and it was right to judge whether it was possible to carry directly.

It'll be another hard round.