Search found 17 matches
- Sat Oct 07, 2006 12:11 pm
- Forum: Volume 101 (10100-10199)
- Topic: 10141 - Request for Proposal
- Replies: 44
- Views: 16073
Judges ans is WA. Deleted after Accepted. Because you may resolve and submit my code. 1. initialize highest=-1 and low_price=999999999999.0 2. I just read, don't store the requirements 3. only keep the highest offer value. 4. if offers==highest_offer then check the low price. and then keep the compa...
By simulating the problem, i derived a greedy(!?) algorithm. But i was thinking that it might be got Run time error in the UVa judges. and it was happened so. My code outputed correctly for little joey 's given input: fill B pour B A empty A pour B A fill B pour B A success // ---- Step: 6 fill A po...