ACM/ICPC 之 DP解有规律的最短路问题(POJ3377)
生活随笔
收集整理的這篇文章主要介紹了
ACM/ICPC 之 DP解有规律的最短路问题(POJ3377)
小編覺得挺不錯(cuò)的,現(xiàn)在分享給大家,幫大家做個(gè)參考.
?
//POJ3377 //DP解法-解有規(guī)律的最短路問題 //Time:1157Ms Memory:12440K #include<iostream> #include<cstring> #include<cstdio> using namespace std;#define MAXN 1000005typedef long long LL;int n; int dp[MAXN][3]; int sr, st, er, ed; int main() {//freopen("in.txt", "r", stdin);while(scanf("%d", &n), n){scanf("%d%d%d%d", &sr,&st,&er,&ed);if(st > ed){swap(st, ed);swap(sr, er);}for(int i = 1; i <= n; i++)scanf("%d", &dp[i][0]);for(int i = 0; i <= n; i++)scanf("%d", &dp[i][2]);for(int i = 1; i <= n; i++)scanf("%d", &dp[i][1]);//更新st從左側(cè)到達(dá)對(duì)岸的最短路for(int i = st, w = 0; i > 0; i--){w += dp[i][0] + dp[i][1]; //間接走陸路的路長和dp[st][2] = min(dp[st][2], w + dp[i-1][2]);if(w >= dp[st][2]) break;}//更新ed從右側(cè)到達(dá)對(duì)岸的最短路for(int i = ed+1, w = 0; i <= n; i++){w += dp[i][0] + dp[i][1];dp[ed][2] = min(dp[ed][2], w + dp[i][2]);if(w >= dp[ed][2]) break;}LL dis[2];dis[sr] = 0; //起始點(diǎn)右移最短路dis[!sr] = dp[st][2]; //對(duì)岸右移最短路for(int i = st + 1; i <= ed; i++){int x = dp[i][sr], y = dp[i][!sr]; //該點(diǎn)與對(duì)岸到達(dá)右一點(diǎn)的路長int z = dp[i][2]; //右側(cè)水路長LL tmp = dis[sr];dis[sr] = min(dis[sr] + x, dis[!sr] + y + z);dis[!sr] = min(dis[!sr] + y, tmp + x + z);}printf("%lld\n", dis[er]);}return 0; }?
轉(zhuǎn)載于:https://www.cnblogs.com/Inkblots/p/5735753.html
總結(jié)
以上是生活随笔為你收集整理的ACM/ICPC 之 DP解有规律的最短路问题(POJ3377)的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。
