| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3993 |
| 2 | jiangly | 3743 |
| 3 | orzdevinwang | 3707 |
| 4 | Radewoosh | 3627 |
| 5 | jqdai0815 | 3620 |
| 6 | Benq | 3564 |
| 7 | Kevin114514 | 3443 |
| 8 | ksun48 | 3434 |
| 9 | Rewinding | 3397 |
| 10 | Um_nik | 3396 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 156 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
Recently I've been trying to solve a bronze USACO problem ( The problem is exploration — the first one at this site: http://tjsct.wikidot.com/usaco-nov07-bronze ).
After understading what do they ask, I now could easily solve it. But what if the statement changes to finding the maximum point we can reach, will there be any solutions?
Thanks in advance :D
P/s: sorry if my english are poor.
Actually it's not greedy solution. Problem exactly asks it.
I thought it was greesy when they choose the point nearest to point 0?
That's the problem itself
hmm....might be... any way I still feel the solution is wrong :P
The problem ask you to go to the point that is 1. Closest to the origin, at cordinate 0. 2. Unvisited before. So I think the solution is quite straight forward. There is no greedy in the solution, just simple implementation.
Shit, my bad :P . But if the statement change to counting what the maximum point u can reach will there be any solution ?
THE PROBLEM IS FUCKING THIS. Problem says go to first, go to second, go to..... by distance to origin
Calm your tits.
Auto comment: topic has been updated by AFatWolf (previous revision, new revision, compare).