|
From: Chien-I L. <ci...@ny...> - 2004-11-04 04:37:47
|
Hi all! You may find some useful materials in http://www2.ee.ntu.edu.tw/~b87144/ICPC/ICPC.htm include a powerpoint and some problems I designed and provided for selceting representative of my undergrad university last year. Most of them have solution using interesting algorithm. If you really tried it, I can provide judge's input and output. (Oh, I was the judge for that competition :) ) The algorithm I used in "G - To the Max" is an O(n^3) one, the code is not complicated, but could have a shorter one if using O(n^4) method. Best, Chien-I Liao |