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).