【dp】Codeforces Beta Round #2 B

http://codeforces.com/problemset/problem/2/B

分别对2和5dp，取最小的，注意有0的情况，如果最后2和5最小值ans>=1时就走0，否则走2、5，至于路径我就用比较方便的方法：对每一点记录前一点的坐标

写得有点搓.......

#define N 1005
int dp[N][N][2];
int n;
bool zero;
struct node{
    int x,y;
}p[N][N][2];
string out(int id){
    string ans;
    int x = n-1,y = n-1;
    while(p[x][y][id].x>-1 && p[x][y][id].y>-1){

        if(p[x][y][id].x == x){
            ans += 'R';
        } else if(p[x][y][id].y == y){
            ans += 'D';
        }
        int xx = p[x][y][id].x,yy = p[x][y][id].y;
        x = xx,y = yy;
    }
    return ans;
}

int main(){
    cin>>n;
    int i,j;
    zero = 0;
    int zx,zy;
    for(i=0;i<n;i++){
        for(j=0;j<n;j++){
            int v;
            cin>>v;
            if(v){
                while(v%2==0){
                    v/=2;
                    dp[i][j][0]++;
                }
                while(v%5==0){
                    v/=5;
                    dp[i][j][1]++;
                }
            } else if(!v){
                zero = 1;
                zx = i,zy = j;
                dp[i][j][0]++;
                dp[i][j][1]++;
            }
            if(!i && !j){
                p[i][j][0].x = -1,p[i][j][0].y = -1;
                p[i][j][1].x = -1,p[i][j][1].y = -1;
            } else
            if(!i && j){
                dp[i][j][0] += dp[i][j-1][0];
                p[i][j][0].x = i,p[i][j][0].y = j-1;

                dp[i][j][1] += dp[i][j-1][1];
                p[i][j][1].x = i,p[i][j][1].y = j-1;
            } else
            if(i && !j){
                dp[i][j][0] += dp[i-1][j][0];
                p[i][j][0].x = i-1,p[i][j][0].y = j;
                dp[i][j][1] += dp[i-1][j][1];
                p[i][j][1].x = i-1,p[i][j][1].y = j;
            } else {
                if(dp[i-1][j][0]<dp[i][j-1][0]){
                    dp[i][j][0] += dp[i-1][j][0];
                    p[i][j][0].x = i-1,p[i][j][0].y = j;
                } else {
                    dp[i][j][0] += dp[i][j-1][0];
                    p[i][j][0].x = i,p[i][j][0].y = j-1;
                }

                if(dp[i-1][j][1]<dp[i][j-1][1]){
                    dp[i][j][1] += dp[i-1][j][1];
                    p[i][j][1].x = i-1,p[i][j][1].y = j;
                } else {
                    dp[i][j][1] += dp[i][j-1][1];
                    p[i][j][1].x = i,p[i][j][1].y = j-1;
                }
            }
        }
    }
    int ans = min(dp[n-1][n-1][0],dp[n-1][n-1][1]);
    if(zero && ans>=1){
        cout<<1<<endl;
        for(i=0;i<zx;i++){
            printf("D");
        }
        for(i=0;i<zy;i++){
            printf("R");
        }
        for(i=zx;i<n-1;i++){
            printf("D");
        }
        for(i=zy;i<n-1;i++){
            printf("R");
        }
        puts("");
    } else {
        cout<<ans<<endl;
        string str;
        if(dp[n-1][n-1][0] < dp[n-1][n-1][1]){
            str = out(0);
        } else str = out(1);
        for(i=str.length()-1;i>=0;i--){
            cout<<str[i];
        }
        cout<<endl;
    }
    return 0;
}