afterward

导航

 

2012年8月5日

摘要: View Code #include <iostream>#include <cstdio>#include <cmath>#include <cstring>#define maxn 155using namespace std;int map[maxn][maxn],res[maxn];bool vt[maxn];int n,m;bool flag;void dfs(int pos,int num){ int i; if (flag) return ; res[num] = pos; for (i = 1;i <= n;++i) { i 阅读全文
posted @ 2012-08-05 17:48 afterward 阅读(358) 评论(0) 推荐(0) 编辑
 
摘要: View Code #include<stdio.h>#include<stdlib.h>#include<string.h>#include<iostream>using namespace std;#define MAX_LEN 101#define is_valid(x, y) ((x)>=0 && (x)<N && (y)>=0 && (y)<M)int N, M;char image[MAX_LEN][MAX_LEN];int visited[MAX_LEN][MA 阅读全文
posted @ 2012-08-05 10:37 afterward 阅读(330) 评论(0) 推荐(0) 编辑