![](https://img-blog.csdnimg.cn/20201014180756926.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
最长上升子序列
Keep_Trying_Go
无
展开
-
HDU1257
最长上升子序列问题:#include<iostream>#include<algorithm>#include<cstring>using namespace std;const int maxx=1005;int a[maxx],f[maxx],c[maxx];int n;int main(){ while(cin>>n){ memset(a,0,sizeof(a)); for(int i=1;i<=n;i++)f[i]=1;原创 2021-03-08 07:28:55 · 50 阅读 · 0 评论 -
HDU1950
最长上升子序列问题:#include<iostream>#include<algorithm>#include<cstring>using namespace std;const int maxx=50005;int a[maxx],f[maxx],c[maxx];int len;int n;int find(int x){ int left=1,right=len; int mid; while(left<=right){ mid=(l原创 2021-03-08 07:28:45 · 100 阅读 · 0 评论 -
poj2533
最长上升子序列问题:#include<iostream>#include<algorithm>#include<cstring>using namespace std;const int maxx=1005;int c[maxx],a[maxx];int len;int p[maxx];int n;int find(int x){ int left=1,right=len; int mid; while(left<=right){ mi原创 2021-03-07 07:35:11 · 110 阅读 · 0 评论 -
poj3903
求解最长上升子序列:#include<iostream>#include<algorithm>#include<cstring>using namespace std;const int maxx=100005;int c[maxx],a[maxx];int len;int p[maxx];int n;int find(int x){ int left=1,right=len; int mid; while(left<=right){原创 2021-03-07 07:34:03 · 60 阅读 · 0 评论 -
poj1631
最长上升子序列:#include<iostream>#include<algorithm>#include<cstring>using namespace std;const int maxx=100005;int c[maxx],a[maxx];int len;int p[maxx];int n;int find(int x){ int left=1,right=len; int mid; while(left<=right){ mi原创 2021-03-07 07:32:55 · 49 阅读 · 0 评论 -
poj1887
最长上升子序列:#include<iostream>#include<algorithm>#include<cstring>using namespace std;const int maxx=100005;int b[maxx],a[maxx];int len;int p[maxx];int n;int find(int x){ int left=1,right=len; int mid; while(left<=right){ mi原创 2021-03-07 07:31:44 · 99 阅读 · 0 评论 -
HDU1025
最长上升子序列:#include<iostream>#include<algorithm>#include<cstring>using namespace std;const int maxx=500005;int a[maxx],p[maxx];int n;int len;int find(int x){ int left=1,right=len; int mid; while(left<=right){ mid=(left+right原创 2021-03-07 07:29:58 · 56 阅读 · 0 评论