Longest Ordered Subsequence POJ - 2533
2017-07-03 10:06
417 查看
用DP的两种做法,一种是 “人人为我” , “我为人人”;字面意思;
还有用 *max_element(a,a+n); 头文件 algorithm 方便多了
①:我为人人
#include <stdio.h>
#include <iostream>
#include <string.h>
#include <algorithm>
#define MAXN 1000+5
using namespace std;
int a[MAXN];
int dp[MAXN];
int main(void)
{
int n;
cin >> n;
for(int i=1;i<=n;i++)
scanf("%d",a+i);
for(int i=1;i<=MAXN;i++)
dp[i]=1;
for(int i=1;i<=n;i++)
{
for(int j=i+1;j<=n;j++)
{
if(a[j]>a[i])
{
dp[j]=max(dp[j],dp[i]+1);
}
}
}
printf("%d\n",*max_element(dp+1,dp+1+n));
}
②:人人为我
#include <stdio.h>
#include <iostream>
#include <string.h>
#include <algorithm>
#define MAXN 1000+5
using namespace std;
int a[MAXN];
int dp[MAXN];
int main(void)
{
int n;
cin >> n;
for(int i=1;i<=n;i++)
scanf("%d",a+i);
for(int i=1;i<=MAXN;i++)
dp[i]=1;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=i;j++)
{
if(a[j]<a[i])
{
dp[i]=max(dp[i],dp[j]+1);
}
}
}
printf("%d\n",*max_element(dp+1,dp+1+n));
}
还有用 *max_element(a,a+n); 头文件 algorithm 方便多了
①:我为人人
#include <stdio.h>
#include <iostream>
#include <string.h>
#include <algorithm>
#define MAXN 1000+5
using namespace std;
int a[MAXN];
int dp[MAXN];
int main(void)
{
int n;
cin >> n;
for(int i=1;i<=n;i++)
scanf("%d",a+i);
for(int i=1;i<=MAXN;i++)
dp[i]=1;
for(int i=1;i<=n;i++)
{
for(int j=i+1;j<=n;j++)
{
if(a[j]>a[i])
{
dp[j]=max(dp[j],dp[i]+1);
}
}
}
printf("%d\n",*max_element(dp+1,dp+1+n));
}
②:人人为我
#include <stdio.h>
#include <iostream>
#include <string.h>
#include <algorithm>
#define MAXN 1000+5
using namespace std;
int a[MAXN];
int dp[MAXN];
int main(void)
{
int n;
cin >> n;
for(int i=1;i<=n;i++)
scanf("%d",a+i);
for(int i=1;i<=MAXN;i++)
dp[i]=1;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=i;j++)
{
if(a[j]<a[i])
{
dp[i]=max(dp[i],dp[j]+1);
}
}
}
printf("%d\n",*max_element(dp+1,dp+1+n));
}
相关文章推荐
- poj 2533 Longest Ordered Subsequence(dp)
- 【最大上升子序列+经典题】北大 poj 2533 Longest Ordered Subsequence
- poj 2533 Longest Ordered Subsequence 最长递增子序列
- POJ 2533 Longest Ordered Subsequence 二分查找(LIS nlogn算法)
- poj 2533 Longest Ordered Subsequence (最长子序列)
- POJ 2533 Longest Ordered Subsequence
- POJ 2533 Longest Ordered Subsequence(单调递增子序列)
- POJ 2533 Longest Ordered Subsequence
- poj 2533 Longest Ordered Subsequence (最长上升子序列)
- poj 2533 Longest Ordered Subsequence(LIS)
- poj-2533-Longest Ordered Subsequence-最长上升子序列
- POJ 2533 Longest Ordered Subsequence(最长上升子序列)
- [POJ 2533]Longest Ordered Subsequence[LIS]
- POJ-2533-Longest Ordered Subsequence
- 文章标题 POJ 2533 : Longest Ordered Subsequence (DP)
- POJ - 2533 Longest Ordered Subsequence
- POJ 2533--Longest Ordered Subsequence
- POJ_2533 Longest Ordered Subsequence【DP】【最长上升子序列】
- Longest Increasing Subsequence[LIS 最长上升子序列问题] (Longest Ordered Subsequence) POJ - 2533 队列优化
- POJ 2533 Longest Ordered Subsequence