题目地址:http://poj.org/problem?id=3414
思路:和HDU1945相似,可以看看本博客解析:http://blog.csdn.net/qq_25605637/article/details/47070597,没想出来,有时间写
AC代码:
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <queue>
#include <stack>
#include <map>
#include <cstring>
#include <climits>
#include <cmath>
#include <cctype>
const int inf = 0x7f7f7f7f;//2139062143
typedef long long ll;
using namespace std;
int a,b,c;
int visit[110][110];
struct node
{
int x;
int y;
int op;
}a[300];
void bfs()
{
int head = 0,tail = 1;
a[0].x = 0;
a[0].y = 0;
a[0].op = -1;
while(head < tail)
{
}
}
int main()
{
while(~scanf("%d%d%d",&a,&b,&c))
{
memset(visit,0,sizeof(visit));
bfs();
}
return 0;
}