Hi.
Here is the link to the editorial. Feel free to discuss problems here and ask me questions.
# | User | Rating |
---|---|---|
1 | tourist | 3803 |
2 | jiangly | 3707 |
3 | Benq | 3627 |
4 | ecnerwala | 3584 |
5 | orzdevinwang | 3573 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | Radewoosh | 3542 |
9 | jqdai0815 | 3532 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 168 |
2 | awoo | 163 |
3 | adamant | 162 |
4 | maroonrk | 152 |
5 | nor | 151 |
5 | -is-this-fft- | 151 |
7 | atcoder_official | 147 |
7 | TheScrasse | 147 |
9 | Petr | 145 |
10 | pajenegod | 144 |
Name |
---|
Change it to read-only access
I'll complete that sentence: Change it to read-only access or you'll end up like Mountain Dew during their Dub the Dew campaign.
in ArraySorting we have to find longest non-decreasing Sequence instead LIS and change other elements.right?
Yes.
Can anybody please explain the solution to the problem "Array Sorting". As i am not good with dp, i am not able to understand the editorialist's approach.
Do you know how to find Longest Increasing Subsequence?
Yes, i know that much.
The answer is n — size of LIS.
Does that mean i just have to set the values of the other elements which are not in the LIS to the minimum possible?
Yes.