小马的博客

//没啥好说的，一道水题而已，直接看代码： AC代码： #include #include #include using namespace std; #define N 1005 int p[N]; int a[N]; int n; int L; struct node { int w,v,c; }t[N*N]; int cmp(node p,node q) { retu

#include #include #include using namespace std; const int maxm=50; char map[maxm][maxm]; int vis[maxm][maxm]; int m,n; int cnt; int dir[4][2]= {{1,0},{-1,0},{0,1},{0,-1}}; void dfs(int x,int y) {

基础BFS#include #include #include #include #include using namespace std; const int maxm=205; const int inf=1<<29; int m,n; int x1,y1,x2,y2; char map[maxm][maxm]; int vis[maxm][maxm]; int w[maxm][maxm];

Travelling Fee Time Limit: 2 Seconds      Memory Limit: 65536 KB Samball is going to travel in the coming vacation. Now it's time to make a plan. After choosing the destination city, the next st