2013年6月30日
POJ 1364 King （差分约束）
摘要： KingTime Limit:1000MSMemory Limit:10000KTotal Submissions:8660Accepted:3263DescriptionOnce, in one kingdom, there was a queen and that queen was expecting a baby. The queen prayed: ``If my child was a son and if only he was a sound king.'' After nine months her child was born, and indeed, sh 阅读全文
posted @ 2013-06-30 23:35 Jack Ge 阅读(269) 评论(0) 推荐(0) 编辑
HDU 3666 THE MATRIX PROBLEM （差分约束 深搜 & 广搜）
摘要： THE MATRIX PROBLEMTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5437Accepted Submission(s): 1372Problem DescriptionYou have been given a matrix CN*M, each element E of CN*Mis positive and no more than 1000, The problem is that if there exist N nu 阅读全文
posted @ 2013-06-30 22:37 Jack Ge 阅读(433) 评论(0) 推荐(0) 编辑
HOJ 1402 整数划分
摘要： HOJ1402 整数划分http://acm.hit.edu.cn/hoj/problem/view?id=1402【题目描述】整数划分是一个经典的问题。希望这道题会对你的组合数学的解题能力有所帮助。Input每组输入是两个整数n和k。(1 #include#includeusing namespace std;const int maxn = 51;int n,k;int f[maxn][maxn], g[maxn][maxn];int f1[maxn][maxn], f2[maxn][maxn];int main () { int i, j; int ans1, ans2, a... 阅读全文
posted @ 2013-06-30 20:52 Jack Ge 阅读(1191) 评论(0) 推荐(0) 编辑