Can somebdy pls help me about how to approach to this problem. http://www.spoj.com/problems/SPEC_SET/
| # | User | Rating |
|---|---|---|
| 1 | jiangly | 3810 |
| 2 | Benq | 3676 |
| 3 | Kevin114514 | 3655 |
| 4 | maroonrk | 3463 |
| 5 | strapple | 3390 |
| 6 | Um_nik | 3387 |
| 7 | tourist | 3384 |
| 8 | heuristica | 3322 |
| 9 | turmax | 3319 |
| 10 | jiangbowen | 3291 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 155 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | Um_nik | 144 |
| 5 | Errichto | 139 |
| 6 | adamant | 137 |
| 6 | AmShZ | 137 |
| 8 | BledDest | 132 |
| 8 | maroonrk | 132 |
| 10 | qwexd | 129 |
Can somebdy pls help me about how to approach to this problem. http://www.spoj.com/problems/SPEC_SET/
| Name |
|---|



When I solved this problem first I wrote a brute-force for small cases to check for a "pattern". If you see the "pattern" then you can come up with a greedy solution. Maybe it will be good idea to train your brute-force skills, nonetheless, here is my brute-force for checking the pattern
http://pastebin.com/qMZ4w0fp