dp 专题

#include <cstdio>
#include <deque>
#include <set>
#include <string>
#include <map>
#include <vector>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <queue>
using namespace std;
typedef long long LL;

inline void out(int x){
    printf(" %d",x);
}
const int maxn = 10;
/*
LL dp[10][1<<maxn];
void dfs(int row,int nows,int lasts,int nowi){
    if(depth == row){

        return;
    }
}
int main(){
    int n,m;
    while(scanf("%d%d",&m,&n)!=-1){
        for(int i=0;i<m;i++){
            dfs(i,0);
        }
    }
}
*/


//int trans[(1<<maxn)][(1<<maxn)];
bool vis[maxn][2];
int n,m;
LL dp[2][maxn];
int f;

void dfs(int i,int j){
    if(j >= n){
        int t = 0;
        for(int k=0;k<n;k++){
            t = t * 2 + vis[k][1];
        }
        //trans[i][t] ++;
        dp[f^1][t] += dp[f][i];
        out(i);out(t);out(dp[f^1][t]);
        cout << endl;
        return ;
    }



    
    if(vis[j][0] == 1){
        dfs(i,j+1);
    }

    if(j < n-1 && vis[j][0] == 1 && vis[j+1][0] == 1){
        vis[j][1] = vis[j+1][1] = 1;
        dfs(i,j+2);
        vis[j][1] = vis[j+1][1] = 0;
    }
    

    

    if(j < n-1 && vis[j][0] == 0 && vis[j+1][0] == 0){
        vis[j][1] = vis[j+1][1] = 1;
        dfs(i,j+2);
        vis[j][1] = vis[j+1][1] = 0;
    }


    if(vis[j][0] == 0){
        vis[j][1] = 1;
        dfs(i,j+1);
        vis[j][1] = 0;
    }
}
/*
void init(int n){
    memset(trans, 0, sizeof(trans));    
    for(int i=0;i<(1<<n);i++){
        for(int j=0;j<n;j++){
            if((i>>j)&1) vis[j][0] = 1; 
            else vis[j][0] = 0;
            vis[j][1] = vis[j][1] = 0;           
        }
        dfs(i,0);
    }
}

*/
void dfs1(int i){
    if(i >= n){
        int t = 0;
        for(int k=0;k<n;k++){
            t = t * 2 + vis[k][0];
        }
        dp[0][t] ++;
        //out(i);out(t);out(dp[0][t]);
        //cout << endl;
        return ;
    }
    dfs1(i+1); 
    if(i < n-1){
        vis[i][0] = vis[i+1][0] = 1;
        dfs1(i+2);
        vis[i][0] = vis[i+1][0] = 0;
    }
}

void solve(int m,int n){
    memset(dp, 0, sizeof(dp));
    //init(n);

    memset(vis, 0 ,sizeof(vis));
    dfs1(0);
    
    for(int ii=1;ii<m;ii++){
        memset(dp[ii%2],0,sizeof(dp[ii%2]));
        for(int i=0;i<(1<<n);i++){
            for(int j=0;j<n;j++){
                if((i>>j)&1) vis[j][0] = 1; 
                else vis[j][0] = 0;
                vis[j][1] = vis[j][1] = 0;           
            }
            f = (ii-1)%2;
            dfs(i,0);
        }
        /*
        for(int j=0;j<(1<<n);j++){
            for(int k=0;k<(1<<n);k++){

            }
                dp[i%2][j] += dp[(i-1)%2][k]*trans[k][j];
        }
        */
    }
    //cout << trans[1][1];
    printf("%I64d\n",dp[(m-1)%2][(1<<n)-1]);
}


int main(){
    while(scanf("%d%d",&m,&n)!=EOF){
        solve(m,n);
    }
    return 0;
}
先放着，以后再总结（不过说以后的都是什么心态，哪会以后总结！）