ldrmcml的专栏

#include#define MAX 205int like[MAX];int strip[10005];int lcs[MAX][10005];int main(){ int N,M,L; scanf("%d",&N); scanf("%d",&M); for(int i=0;i<M;i++) scanf("%d",&like[i]); scanf("%d",&L); for(int i=0;

/*最长上升子序列问题(LIS,Longest Increasing Subsequence)*/ /* 6 5 2 3 1 5 6 1 4 */ #include #define MAX 205 int like[MAX]; int strip[10005]; int fav[10005]; int order[MAX]; int main(){ int N,M,L,max,res=0;