厦门饮冰信竞

#include <cstdio>#include <algorithm>#include <cstring>using namespace std;const int Tmax=105,inf=0x3f3f3f3f;int f[Tmax][Tmax];int dp(int n,int m){ if(f[n][m]<inf) return f[n][m];//如果已经算过了就不需要再算了 , if(m==1) return f[n][.

#include <iostream>#include<stdio.h>#include<string.h>#include<algorithm>#include<math.h>#include<sstream>using namespace std;#define L 101const int N=5,K=7; int a[L+1]={0,1,2,3,4,5};int f[L][L];//f[i][j]表示前i个.

#include <iostream>#include<stdio.h>#include<string.h>#include<algorithm>#include<math.h>#include<sstream>using namespace std;#define L 101const int AL=5;const int BL=5;char a[AL+2]=".mnklj";char b[BL+2]=".j.

#include <iostream>#include<stdio.h>#include<string.h>#include<algorithm>#include<math.h>#include<sstream>using namespace std;#define L 101const int AL=7;const int BL=6;int f[L][L];char z[L][L][L]; //1维char存储.