sunshine945

j简单题#include#includeint array[5][5];int visited[5][5];struct Point{ int x, y; int pre_num;};Point que[100];int dir[4][2] = {-1, 0, 0, -1, 1, 0, 0, 1};void print(Point s) { if(s.

网络最大流 #include#include#define MAXM 205#define INF 2000000005struct Arc_Infor{ int c, f;};Arc_Infor Edge[MAXM][MAXM];int flag[MAXM], pre[MAXM], change[MAXM];int que[MAXM];int N, M; v

题意及思路和详细说明见http://www.xuebuyuan.com/#include#include#define MAXN 250#define INF 1000000int dist[MAXN][MAXN];int que[MAXN];int map[MAXN][MAXN];bool used[MAXN], level[MAXN][MAXN];int N, M, K,

跟poj3667差不多#include#include#includeusing namespace std;const int MAXN = 50005;struct Tree{ int l, r; int l_len, r_len; int t_len;};Tree tree[MAXN << 2];int record[MAXN];int N,

推箱子，嵌套BFS， 比较直白http://www.xuebuyuan.com/304871.html#include#include#include#includeusing namespace std;#define MAXN 25int dir[4][2] = {-1, 0, 0, -1, 1, 0, 0, 1};int vis_box[MAXN][MAXN],

bfs+优先队列+邻接链表细节说明见http://www.xuebuyuan.com/321339.html#include#include#includeusing namespace std;#define MAXN 1005int N, M, cnt;int oil_price[MAXN];int dist[MAXN][MAXN];struct Node{ i

还是很简单的吧，也就几行代码#include#include#define MAXN 105int N, arr[MAXN][MAXN];int x_used[MAXN][11], y_used[MAXN][11], n_used[MAXN][11];int main() { freopen("poj3435.txt", "r", stdin); while(sca