I'd be happy if someone explained the solutions of E and J.
http://acm.math.spbu.ru:17249/~ejudge/files/opencup/oc12/gp6/gpce-e.pdf
№ | Пользователь | Рейтинг |
---|---|---|
1 | ecnerwala | 3648 |
2 | Benq | 3580 |
3 | orzdevinwang | 3570 |
4 | cnnfls_csy | 3569 |
5 | Geothermal | 3568 |
6 | tourist | 3565 |
7 | maroonrk | 3530 |
8 | Radewoosh | 3520 |
9 | Um_nik | 3481 |
10 | jiangly | 3467 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
2 | adamant | 164 |
4 | TheScrasse | 159 |
4 | nor | 159 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 150 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
I'd be happy if someone explained the solutions of E and J.
http://acm.math.spbu.ru:17249/~ejudge/files/opencup/oc12/gp6/gpce-e.pdf
Название |
---|
Problem E.
Let
calc(i, j)
be the maximum coverage length of a special symboli
in the patternP
starting fromP[j]
. Then for each equation of the form A = B + C,calc(A, j) = calc(B, j) + calc(C, j + calc(B, j))
, and for equation A = a word over * {a, ..., z} we count it the simple way.To speed up, use a hash table (unordered_map) to memorize
calc(i, j)
values.The solution is then
calc(S, 0) == strlen(P)
.