- 博客(2)
- 资源 (5)
- 收藏
- 关注
原创 PKU1475
<br />从大一暑假开始就想A的题,虽然很水的吧...<br />#include <stdio.h> #include <queue> using namespace std; struct Node { int key; int sx, sy, bx, by; bool operator < (const Node &oth) const { return key > oth.key; } }; const int dir
2011-06-02 13:37:00 616
原创 PKU 1191
<br />#include <iostream> #include <cmath> using namespace std; const int inf = 1000000000; const int maxs = 9; const int maxn = 15; int n; int mat[maxs][maxs]; int dp[maxn][maxs][maxs][maxs][maxs]; void solve() { int k, f, x1, y1, x2, y2;
2011-06-01 16:08:00 622
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人