http://www.spoj.com/problems/MUSKET/ hello everyone,there is a nice problem from polish olympiad,i have tried to solve it but ... can someone explain how solve it? or if have some ideas share it each other. sorry for my bad english.
→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3814 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3517 |
| 7 | Radewoosh | 3410 |
| 8 | hos.lyric | 3399 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 169 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 4 | atcoder_official | 161 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | awoo | 154 |
| 8 | Dominater069 | 154 |
| 10 | luogu_official | 150 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Dec/21/2024 00:41:14 (j3).
Desktop version, switch to mobile version.
Supported by
To solve this problem you have to use dynamic programming to answer the question if ith and jth musketeer can be the last two fighters in the tournament. Then you just check which one wins this kind of duel and add the winner to the output. You can also have some fun simulating the tournament for x times, this kind of solution was given around 70% of points on the POI. If you have some more doubts, ask.
can't understand ;|
You can check out my AC code: http://ideone.com/nzAuoP. Sorry for formatting it is really old :(.