UVA 11270 Tiling Dominoes(插头DP)

2014-11-24 13:03:39 · 作者: · 浏览: 0

题目链接:11270 - Tiling Dominoes

和POJ 2411一样的题目,试着用插头DP写了下 代码:
#include 
  
   
#include 
   
     #include 
    
      using namespace std; int n, m, pre = 0, now = 1; long long dp[2][2222]; int main() { while (~scanf("%d%d", &n, &m)) { if (n