Longest Ordered Subsequence POJ
来源:互联网 发布:中国水资源的浪费数据 编辑:程序博客网 时间:2024/05/28 08:29
用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));
}
- Longest Ordered Subsequence POJ
- Longest Ordered Subsequence POJ
- Longest Ordered Subsequence POJ
- Longest Ordered Subsequence POJ
- POJ 2533 Longest Ordered Subsequence
- poj 2533Longest 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
- 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
- poj 2533 Longest Ordered Subsequence
- Java堆栈实现
- Flask模版实例:自定义错误页面
- cent7下rocketmq集群配置
- 解决百度网盘超过4G限制,
- 嵌入式开发平台 迅为4418开发板如何修改开机logo?
- Longest Ordered Subsequence POJ
- windows下,分析svn日志提取变更
- SA工作流程
- 文章标题
- Foreword
- Java (1)寻找一堆数字中只出现一次的数字 (2)统计一堆文件后缀名共有几种类型(即统计一堆数字中出现过那几个数字)
- Windows error[2]解决方法
- C++之常量
- flex布局