2011年7月30日
poj2339
摘要： 简单题View Code #include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>using namespace std;#define maxn 105int n, m, d;char map[2][maxn][maxn];int dir[4][2] ={{ 1, 0 },{ 0, 1 },{ -1, 0 },{ 0, -1 } };void input(){ scanf("%d%d%d", &n, &m, &d) 阅读全文
posted @ 2011-07-30 17:59 undefined2024 阅读(225) 评论(0) 推荐(0)
poj1037
摘要： dp很复杂，具体参见黑书p257页。View Code #include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>using namespace std;#define maxn 30struct Node{ long long up, down;} g[maxn][maxn];long long n;long long c;long long ans[maxn];void getfirst(long long n, long long c, bool u){ 阅读全文
posted @ 2011-07-30 17:11 undefined2024 阅读(742) 评论(1) 推荐(0)