比赛链接: http://acm.hust.edu.cn/vjudge/contest/view.action?cid=44857#overview
题目来源: ZOJ Monthly, July 2012
Wine93有话说: 这场打得还可以, 做出5题, 最后没成功绝杀H,有点遗憾! 感觉这套题裸题特别多!
400 / 1404 | Problem A | Magic Number (找规律打表) | |
200 / 506 | Problem B | Battle Ships (蛮好的DP,最短路类DP处理技巧) | |
11 / 20 | Problem C | Count Path Pair (蛮好的题 不相交条数 = 总条数 - 相交 = ad * bc - ac * bd, 因为ac,bd必定相交) | |
12 / 43 | Problem D | Geek's Collection | |
135 / 286 | Problem E | Treasure Hunt I (很简单的树形DP) | |
55 / 178 | Problem F | Treasure Hunt II (简单的分析题! 分析就可以下,最后暴力枚举下!) | |
29 / 101 | Problem G | Treasure Hunt III | |
136 / 318 | Problem H | Treasure Hunt IV (打表找规律 + 二分, 注意数据乘的时候会超范围,用usinged long long) | |
75 / 189 | Problem I | Information | |
214 / 1014 | Problem J | Watashi's BG (常用技巧,折半搜索 || 暴搜 + 个剪枝) | |
119 / 344 | Problem K | Watermelon Full of Water (简单题,从后往前地推,线段树维护最小值即可) |