【poj 2533】Longest Ordered Subsequence 题意&题解&代码(C++)
来源:互联网 发布:毕向东java基础教程 编辑:程序博客网 时间:2024/06/03 23:00
题目链接
http://poj.org/problem?id=2533
题意:
最长严格上升子序列长度
代码:
#include<iostream>#include<algorithm>#include<stdio.h>#include<string.h>using namespace std;int ans,n,f[1005],dp[1005];int main(){ ans=0; scanf("%d",&n); for (int i=1;i<=n;i++) { scanf("%d",&f[i]); dp[i]=1; } for (int i=1;i<=n;i++) for (int j=1;j<i;j++) if (f[j]<f[i]) dp[i]=max(dp[i],dp[j]+1); for (int i=1;i<=n;i++) ans=max(ans,dp[i]); printf("%d\n",ans);}
0 0
- 【poj 2533】Longest Ordered Subsequence 题意&题解&代码(C++)
- POJ 2533(Longest Ordered Subsequence)
- poj - 2533 - Longest Ordered Subsequence(LIS)
- Poj 2533 Longest Ordered Subsequence(LIS)
- poj 2533 Longest Ordered Subsequence (LIS)
- POJ 2533-Longest Ordered Subsequence(DP)
- POJ 2533 Longest Ordered Subsequence (LIS)
- poj 2533 Longest Ordered Subsequence(dp)
- POJ 2533 Longest Ordered Subsequence(LIS)
- POJ 2533 Longest Ordered Subsequence (LIS)
- POJ-2533Longest Ordered Subsequence(LIS)
- Longest Ordered Subsequence(POJ-2533)
- POJ 2533 Longest Ordered Subsequence(LIS)
- POJ 2533 Longest Ordered Subsequence
- poj 2533Longest Ordered Subsequence
- poj 2533 Longest Ordered Subsequence
- Poj 2533 Longest Ordered Subsequence
- poj 2533 Longest Ordered Subsequence
- Android volley添加Cookie
- Squirrel SQL Client连接hive安装部署
- Linux slab 分配器剖析
- 使用Oracle数据库字典表生成MyBatis配置
- 2017阿里内推实习生面试经历(已获得offer)
- 【poj 2533】Longest Ordered Subsequence 题意&题解&代码(C++)
- Android工程笔记:项目文件结构介绍
- 2.1趣味数学之个人所得税问题
- 有关OJ中PE的一些解决方法(持续更新。。。)
- 针对架构设计的几个痛点,我总结出的架构原则和模式
- import caffe 显示没有caffe module
- hdu 1260 Tickets(dp)
- Duplicate entry '0' for key 'PRIMARY'
- 使用clonezilla将RHEL6.7物理机转化为kvm虚拟机