Overview:

。。最水的一套。。（但是 C 题还是要强力推荐！。。

http://acm.zju.edu.cn/onlinejudge/searchProblem.do?contestId=1&titlefrom=0&authorfrom=0&sourcefrom=0&query=Andrew+Stankevich%27s+Contest+%235

Problem A. Unique Attack
网络流, 染色 520ms
http://acm.hust.edu.cn:8080/judge/problem/viewSource.action?id=617256

Problem B. Burning Bridges
桥
http://acm.hust.edu.cn:8080/judge/problem/viewSource.action?id=624498

Problem C. Circles
Euler characteristic, Nice
http://acm.hust.edu.cn:8080/judge/problem/viewSource.action?id=624529

http://en.wikipedia.org/wiki/Euler_characteristic

Problem D. Linear Programming Dual
模拟

http://acm.hust.edu.cn:8080/judge/problem/viewSource.action?id=624741

http://en.wikipedia.org/wiki/Linear_programming#Duality

Problem E. DVD
DP
http://acm.hust.edu.cn:8080/judge/problem/viewSource.action?id=625539

Problem F. Think Positive
单调队列。。（结论 -> 算数。。

http://acm.hust.edu.cn:8080/judge/problem/viewSource.action?id=625586

Problem G. Ranking
模拟。。
http://acm.hust.edu.cn:8080/judge/problem/viewSource.action?id=626668

Problem H. Driving Straight
bfs() + 模拟。。
（。。题目本身倒是没什么难度。。不过读入数据的地方很奇怪。。
題目が自分ではかもしれないけど。。データ読み込みの地方はおかしい
http://acm.hust.edu.cn:8080/judge/problem/viewSource.action?id=627911

Posted by xiaodao
Category: Andrew Stankevich’s Contest