pku 1015 Jury Compromise
http://acm.pku.edu.cn/JudgeOnline/problem?id=1015
下面是我的代码,我是用动态规划做的,我自己测试的答案也是对的,但是它老说我Wrong Answer!到底是哪里错了?
#include
#include
#define N 202
#define M 22
int d[N + 1], p[N + 1];
int f[N + 1][M + 1];
int S[N + 1][M + 1];
int l[N + 1][M + 1];
int n, m;
int times = 0;
void dp() {
int i, j, x1, x2, y1, ...
by
pz0513
-
C/C++
-
2009-07-28 09:43:10 阅读(1501) 回复(3)