poj-2533-Longest Ordered Subsequence
来源:互联网 发布:mac版绘画软件 编辑:程序博客网 时间:2024/04/30 00:50
就是一个普普通通的最长上升子序列的问题。网上模板一堆。也就不多做说明了
#include<cstdio>#include<cstring>#include<algorithm>#include<iostream>using namespace std;int main(){ int n; while(scanf("%d",&n)!=EOF) { int dp[10005]; int a[10005]; memset(a,0,sizeof(a)); dp[0]=1; for(int i=0;i<n;i++) scanf("%d",&a[i]); int maxx=0; for(int i=1;i<n;i++) { int temp=0; for(int j=0;j<i;j++) if(a[i]>a[j]) if(temp<dp[j]) temp=dp[j]; dp[i]=temp+1; } for(int i=0;i<n;i++) maxx=max(dp[i],maxx); printf("%d\n",maxx); } return 0;}
0 0
- 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
- POJ 2533 Longest Ordered Subsequence
- POJ 2533 Longest Ordered Subsequence
- POJ 2533 : Longest Ordered Subsequence
- POJ 2533 Longest Ordered Subsequence
- 求四个数的最大公约数
- C++作业2
- 换分币
- C++实验2-标准体重
- c++实验2-分段函数求值
- poj-2533-Longest Ordered Subsequence
- SSL/TLS 协议介绍
- 第四周上机实践项目 项目5--用递归方法求解(1)
- 学习动画总结——寄宿图
- 第四周项目5——(2)求1*3*...*n的值
- 一步一步实现一个简单的OS(任务切换)
- php扩展模块安装 快速自动安装
- 找出一个数组中子数组和的最大值
- 利用正则表达式对比数据库