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.
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3885 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3580 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3506 |
| 7 | ecnerwala | 3505 |
| 8 | Radewoosh | 3457 |
| 9 | Kevin114514 | 3377 |
| 10 | gamegame | 3374 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 170 |
| 2 | Um_nik | 162 |
| 3 | atcoder_official | 161 |
| 4 | -is-this-fft- | 160 |
| 5 | djm03178 | 157 |
| 6 | Dominater069 | 156 |
| 7 | maomao90 | 155 |
| 8 | adamant | 154 |
| 9 | luogu_official | 153 |
| 10 | awoo | 152 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Dec/31/2024 21:37:56 (h1).
Desktop version, switch to mobile version.
Supported by
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:))