摘要：#include <stdio.h>#include <string.h>int main(){ int a[1500],b[1500],c[1500],i,j,n,max; scanf("%d",&n); for (i=0;i<n;++i) scanf ("%d",&a[i]); memset(b,0,sizeof(b)); memset(c,0,sizeof(c)); for (i=0;i<n;++i)//从左边开始寻找最长上升子序列 { b[i]=1; for (j=0;j<i;++j) i 阅读全文