题源求最长上升子序列显然如果比之前的序列长那就dp序列#includebits/stdc.husingnamespacestd;#defineintlonglongconstintN1e39;intarr[N];intdp[N],ans1;signedmain(){intn;scanf(%lld,n);for(inti1;in;i){cinarr[i];}for(inti1;in;i){dp[i]1;for(intj1;ji;j){if(arr[j]arr[i]){dp[i]max(dp[j]1,dp[i]);}}ansmax(ans,dp[i]);}coutans;//不一定最后是最大值过程中的最大值}