题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=3152
题目意思:给出一个权值矩阵,找一条从(0,0)点到(n-1,n-1)点的路径使得路径之和最大,输出这个最大路径。
题目分析:记忆化搜索或者DFS+剪枝或者BFS+优先队列
DFS+剪枝华丽丽的超时了,换成BFS+优先队列果断AC
DFS+剪枝的代码:
#include<iostream>
#include<queue>
using namespace std;
const int maxn=130,inf=1<<30;
int dp[maxn][maxn],Map[maxn][maxn],ans,n;
int dir[4][2]={{0,1},{1,0},{-1,0},{0,-1}};
void dfs(int x,int y,int s)
{
if(x==n-1&&y==n-1)
{
// cout<<"yes"<<endl;
ans=min(ans,s);
return ;
}
for(int i=0;i<4;i++)
{
int nx=x+dir[i][0],ny=y+dir[i][1];
//cout<<"yes"<<endl;
// cout<<nx<<" "<<ny<<endl;
// cout<<"dp[nx][ny] = "<<dp[nx][ny]<<" dp[x][y] = "<<dp[x][y]<<endl;
if(0<=nx&&nx<n&&0<=ny&&ny<n&&dp[nx][ny]>dp[x][y])
{
// cout<<"yes"<<endl;
dp[nx][ny]=s+Map[nx][ny];
dfs(nx,ny,s+Map[nx][ny]);
}
}
}
int main()
{
int Case=1;
cin.sync_with_stdio(false);
while(cin>>n,n)
{
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)
cin>>Map[i][j];
fill(&dp[0][0],&dp[maxn][0],inf);
dp[0][0]=Map[0][0];
ans=inf;
dfs(0,0,Map[0][0]);
cout<<"Problem "<<Case++<<": "<<ans<<endl;
}
return 0;
}
BFS+优先队列
#include<iostream>
#include<queue>
using namespace std;
const int maxn=150,inf=1<<30;
int dir[4][2]={{0,1},{1,0},{0,-1},{-1,0}};
int n,Map[maxn][maxn],vis[maxn][maxn];
struct node
{
int x,y,s;
friend bool operator <(node a,node b)
{
return a.s>b.s;
}
};
int bfs()
{
priority_queue<node>q;
node t,now;
now.x=0;now.y=0;now.s=Map[0][0];
q.push(now);
fill(&vis[0][0],&vis[maxn][0],inf);
vis[0][0]=Map[0][0];
while(q.size())
{
now=q.top();q.pop();
if(now.x==n-1&&now.y==n-1) return now.s;
for(int i=0;i<4;i++)
{
t=now;
t.x+=dir[i][0];t.y+=dir[i][1];
if(0<=t.x&&t.x<n&&0<=t.y&&t.y<n)
{
t.s+=Map[t.x][t.y];
if(vis[t.x][t.y]<=t.s) continue;
vis[t.x][t.y]=t.s;
q.push(t);
}
}
}
return -1;
}
int main()
{
int Case=1;
while(cin>>n,n)
{
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)
cin>>Map[i][j];
cout<<"Problem "<<Case++<<": "<<bfs()<<endl;
}
return 0;
}