I have use a O(n^2/31) dynamic programming approach and use bitset optimization and get AC 0.06s..
1873447 09:40:10 Scenery Accepted 0.06 s C++
here is my code:
algorithm correctness have not been proved yet,
# | User | Rating |
---|---|---|
1 | tourist | 3690 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 165 |
3 | adamant | 163 |
4 | TheScrasse | 160 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
world finals 2017 problem H
I have use a O(n^2/31) dynamic programming approach and use bitset optimization and get AC 0.06s..
1873447 09:40:10 Scenery Accepted 0.06 s C++
here is my code:
algorithm correctness have not been proved yet,
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en1 | Los_Angelos_Laycurse | 2017-05-27 10:45:02 | 272 | Initial revision (published) |
Name |
---|