Hi.
Here is the link to the editorial. Feel free to discuss problems here and ask me questions.
# | User | Rating |
---|---|---|
1 | ecnerwala | 3649 |
2 | Benq | 3581 |
3 | orzdevinwang | 3570 |
4 | Geothermal | 3569 |
4 | cnnfls_csy | 3569 |
6 | tourist | 3565 |
7 | maroonrk | 3531 |
8 | Radewoosh | 3521 |
9 | Um_nik | 3482 |
10 | jiangly | 3468 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 162 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 151 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
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.