Problem 629D - Babaei and Birthday Cake asks for the heaviest strictly increasing subsequence of a set of volumes. When I saw this problem (in practice) I immediately recognized that this was probably a well-known problem, so I looked up code. I found some code from StackOverflow, but it occured to me that this code only found the heaviest nondecreasing subsequence. Not willing to change the code too much, I came up with the following idea. If taking the array one by one is like:

```
l = []
for r in range(n):
k = int(input())
l.append(k)
```

then in order to make the heaviest strictly increasing subsequence roughly equal to the heaviest nondecreasing subsequence, do something along these lines. This should work, because the epsilon is small enough such that the relative order should not be changed, but equal terms will have a difference: terms which come closer to the front will be ever so slightly larger than equal terms closer to the end.

```
l = []
for r in range(n):
k = int(input())
l.append(k + (n-r)*0.000001)
```

I submitted this idea, 16347971, but it did not succeed. Why? Because floats do not have sufficient precision, and the numbers in the array can range from 1e15 to 1. Hence, this will have negligible difference under this. The naive way to fix this is just to increase the precision of the numbers, like this:

```
l = []
for r in range(n):
k = int(input())
l.append(Decimal(k) + Decimal((n-r)*0.000001))
```

I tried this too, but it turns out that we in fact get TLE when we try this, even when we water down the precision: 16348275. And who can blame this? We clearly have to undergo a paradigm shift, because this is bad: since the numbers change so much: a fixed error for each term is not acceptable. How about instead of an absolute error, we use a *relative* error?

This would look like:

```
l = []
for r in range(n):
k = int(input())
l.append(k + (n-r)*k*0.00000001)
```

The reason this works is that equal terms are still larger when they come at the front. However, this method has its own flaws: for instance, there is a chance that if k is large enough, this term will become larger than k+1. Furthermore, the sum of all terms in the subsequence will have a significant difference with the original value. This can be fixed, however, by using a small enough epsilon, as seen below:

```
l = []
for r in range(n):
k = int(input())
l.append(k + (n-r)*k*0.00000000001)
```

Surely enough, this gets AC! 16348026

Hopefully this brightened up your day!

Very nice solution.

But the real question is -- why are you on CF during school :)?

It was during computer science class, so I had a valid reason to be on a computer.

CF all day CF all night; get bad grades; sad because still cyan instead of bad grades :(

You might be cyan but I'd like to thank you for your work on easyctf!

If you really wanted to simply modify the existing set, a better way would have been to rank the numbers (using integers) and make equal elements ranking depend on their position in the array (the one's that appear earlier = lesser rank) you could have done this by making them pairs.

Just modify v : 1 1 1 1 2 To : (1,1) (1,2) (1,3) (1,4) (2,5)

Then run the same algorithm!