### maroonrk's blog

By maroonrk, history, 2 months ago,

We will hold AtCoder Regular Contest 130.

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

We are looking forward to your participation!

• +158

 » 2 months ago, # |   +7 Good luck on this round!
 » 2 months ago, # |   +29 It will be very hard.(as usual)
 » 2 months ago, # |   +11 It is really hard to solve the problems!
 » 2 months ago, # |   0 If it exists, print the lexicographically smallest among such sequences A, in one line, with spaces in between.WHAAAYYY???
 » 2 months ago, # |   +10 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.
 » 2 months ago, # |   +5 Can anyone explain D to me in simple? I don't get the editorial :(
•  » » 2 months ago, # ^ |   +3 It may be useful to read this first: Combining subtrees
 » 2 months ago, # |   0 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.
 » 2 months ago, # |   +3 It'll be another hard round.
 » 2 months ago, # |   0 It’s so hard!(though not really participated)