poj 2533
2014-08-12 10:33
281 查看
#include<iostream>
#include <cstdio>
using namespace std;
int n,a[1001],b[1001];
int main()
{ int i,j,best=0;
scanf("%d",&n);
for(i=1;i<=n;i++)
{ scanf("%d",&a[i]); b[i]=1; }
for(i=1;i<=n;i++)
{ int maxx=0;
for(j=1;j<i;j++)
if(a[i]>a[j]&&b[j]>maxx) maxx=b[j];
b[i]=maxx+1;
if(best<b[i]) best=b[i];
}
printf("%d\n",best);
return 0;
}
#include <cstdio>
using namespace std;
int n,a[1001],b[1001];
int main()
{ int i,j,best=0;
scanf("%d",&n);
for(i=1;i<=n;i++)
{ scanf("%d",&a[i]); b[i]=1; }
for(i=1;i<=n;i++)
{ int maxx=0;
for(j=1;j<i;j++)
if(a[i]>a[j]&&b[j]>maxx) maxx=b[j];
b[i]=maxx+1;
if(best<b[i]) best=b[i];
}
printf("%d\n",best);
return 0;
}
相关文章推荐
- Longest Ordered Subsequence(POJ-2533)
- POJ2533——Longest Ordered Subsequence
- poj 2533 Longest Ordered Subsequence(最长上升子序列)
- poj 2533 LIS(最长上升子串)入门
- poj 2533 Longest Ordered Subsequence
- Longest Ordered Subsequence POJ - 2533(最长上升子序列)
- POJ 2533 最长上升子序列 [动态规划 + 二分搜索]
- POJ 2533 Longest Ordered Subsequence(基础DP)
- POJ 2533 Longest Ordered Subsequence (LOS)
- POJ 2533 Longest Ordered Subsequence
- POJ-2533-Longest Ordered Subsequence(LIS模板)
- poj 2533(裸的LIS,很少见的水题)
- poj 2533 Longest Ordered Subsequence
- Longest Ordered Subsequence POJ - 2533
- poj 2533/3903 Longest Ordered Subsequence(最长升序子串)
- 最长上升子序列 POJ 2533(n*n与 nlogn)
- POJ 2533-Longest Ordered Subsequence(裸LIS)
- poj 2533 Longest Ordered Subsequence
- POJ 2533 Longest Ordered Subsequence
- POJ 2533 Longest Ordered Subsequence(DP最长上升子序列O(n^2)&&O(nlogn))