i want to solve this problem with DP http://codeforces.net/contest/180/problem/C there is no editorial for it. thanks for helping. i already soled it other way.
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
9 | nor | 153 |
i want to solve this problem with DP http://codeforces.net/contest/180/problem/C there is no editorial for it. thanks for helping. i already soled it other way.
Name |
---|
We can count for each posicion sum of numbers of Big letters righter and Small letters lefter it, and the answer will be minimum of this sum for all posicions (sorry for my English:))