UVA - 10564 Paths through the Hourglass DP

问题

https://vjudge.net/problem/UVA-10564

分析

这道题先用从后往前递推确定结果和最有起始点，然后递归dfs,从最上层到底层，求解路径比较方便，不用保存字符串，而只用递推的方法就比较麻烦些
重要参考：https://www.jianshu.com/p/b73bc23897fd（重要的，比较简单的解法）
http://www.bubuko.com/infodetail-309480.html
https://www.cnblogs.com/ember/p/4915561.html
注意 结果要用LL

代码

#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <map>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
using namespace std;
typedef long long LL;
const int maxn=20+2;
int n,S,cell[2*maxn][maxn],vis[2*maxn][maxn][505],kase=0;

struct State{
    LL num;  //路线数量
    int start; //起始地点
    string s;
    State(LL num=0,int start=0,string s=""):num(num),start(start),s(s){}
    bool operator < (const State &rhs) const {
        return start<rhs.start || (start==rhs.start && s<rhs.s);
    }
}state[2*maxn][maxn][505];

int main(void){
    while(scanf("%d%d",&n,&S)==2 && n){
        ++kase;
        for(int i=1;i<=n;++i){
            for(int j=1;j<=n-i+1;++j)
                scanf("%d",&cell[i][j]);
        }
        for(int i=n+1;i<(n<<1);++i){
            for(int j=1;j<i-n+2;++j){
                scanf("%d",&cell[i][j]);
            }
        }

        for(int j=1;j<=n;++j){
            vis[1][j][cell[1][j]]=kase;
            state[1][j][cell[1][j]]=State(1,j,"");
        }
        for(int i=2;i<=n;++i){
            for(int j=1;j<=n-i+1;++j){
                for(int k=cell[i][j];k<=S;++k){
                    int &t1=vis[i-1][j][k-cell[i][j]],&t2=vis[i-1][j+1][k-cell[i][j]];
                    if(t1==kase || t2==kase) vis[i][j][k]=kase;
                    if(t1==kase && t2==kase){
                        if(state[i-1][j][k-cell[i][j]]<state[i-1][j+1][k-cell[i][j]]){
                            state[i][j][k]=state[i-1][j][k-cell[i][j]];
                            state[i][j][k].s+='R';
                        }else{
                            state[i][j][k]=state[i-1][j+1][k-cell[i][j]];
                            state[i][j][k].s+='L';
                        }
                        state[i][j][k].num=state[i-1][j][k-cell[i][j]].num+state[i-1][j+1][k-cell[i][j]].num;
                    }else if(t1==kase){
                        state[i][j][k]=state[i-1][j][k-cell[i][j]];
                        state[i][j][k].s+='R';
                    }else if(t2==kase){
                        state[i][j][k]=state[i-1][j+1][k-cell[i][j]];
                        state[i][j][k].s+='L';
                    }
                }
            }
        }
        for(int i=n+1;i<(n<<1);++i){
            for(int j=1;j<i-n+2;++j){
                for(int k=cell[i][j];k<=S;++k){
                    int &t1=vis[i-1][j-1][k-cell[i][j]],&t2=vis[i-1][j][k-cell[i][j]];
                    if(t1==kase || t2==kase) vis[i][j][k]=kase;
                    if(t1==kase && t2==kase){
                        if(state[i-1][j-1][k-cell[i][j]]<state[i-1][j][k-cell[i][j]]){
                            state[i][j][k]=state[i-1][j-1][k-cell[i][j]];
                            state[i][j][k].s+='R';
                        }else{
                            state[i][j][k]=state[i-1][j][k-cell[i][j]];
                            state[i][j][k].s+='L';
                        }
                        state[i][j][k].num=state[i-1][j-1][k-cell[i][j]].num+state[i-1][j][k-cell[i][j]].num;
                    }else if(t1==kase){
                        state[i][j][k]=state[i-1][j-1][k-cell[i][j]];
                        state[i][j][k].s+='R';
                    }else if(t2==kase){
                        state[i][j][k]=state[i-1][j][k-cell[i][j]];
                        state[i][j][k].s+='L';
                    }
                }
            }
        }
        State ans(0,500,"");
        for(int j=1;j<=n;++j){
            if(vis[2*n-1][j][S]==kase){
                ans.num+=state[2*n-1][j][S].num;
                if(state[2*n-1][j][S]<ans) {
                    ans.start=state[2*n-1][j][S].start;
                    ans.s=state[2*n-1][j][S].s;
                }
            }
        }
        if(ans.start==500) printf("0\n\n");
        else  printf("%lld\n%d %s\n",ans.num,ans.start-1,ans.s.c_str());
    }
    return 0;
}