problem is http://www.spoj.com/problems/MAX_NUM/
Actually i'm trying this problem for long time but ends up clueless.....
any kind of help..
# | 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 |
problem is http://www.spoj.com/problems/MAX_NUM/
Actually i'm trying this problem for long time but ends up clueless.....
any kind of help..
Name |
---|
It is very easy if you get it. Simply search in the number for the first position i where n[i] < n[i+1] (n[i] is the digit in the ith position) and delete it. Just a simple greedy strategy, but be aware of the boundary cases.