题目:http://pat.zju.edu.cn/contests/pat-a-practise/1045
题解:
DP。转换成求最长递增子序列。
代码:
#include<cstdio>
#include<iostream>
#include<cstring>
#include<cmath>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<algorithm>
#include<sstream>
using namespace std;
int dp[10005];
int num[205];
int stripe[10005];
int main()
{
int n,m,k,ans,x;
memset(num,-1,sizeof(num));
scanf("%d",&n);
......
阅读全文