Longest Ordered Subsequence(dp)
来源:互联网 发布:spark大数据平台 编辑:程序博客网 时间:2024/05/21 13:22
题目大意: 在n个数中找到最长递增连续子列
思路:简单的dp,找到最长递增子列即可,循环方法很多,重点是核心判断的方程
if(z[j]>z[i]) if(dp[i]+1>dp[j])dp[j]=dp[i]+1;
坑点:dp初始化不能忘,不然会wrong
#include<stdio.h>int z[1005];int dp[1005];int num;int main(void){ scanf("%d",&num); inti; for(i=0;i<num;i++){ scanf("%d",&z[i]);dp[i]=1; } intj; intans=0; for(i=0;i<num-1;i++){ for(j=i+1;j<num;j++){ if(z[j]>z[i]){ if(dp[i]+1>dp[j])dp[j]=dp[i]+1; } } } for(i=0;i<num;i++)if(dp[i]>ans) ans=dp[i]; printf("%d\n",ans); return0;}
0 0
- Longest Ordered Subsequence(dp)
- Longest Ordered Subsequence(dp)
- Longest Ordered Subsequence (dp)
- Longest Ordered Subsequence [dp]
- Longest Ordered Subsequence --DP
- POJ 2533-Longest Ordered Subsequence(DP)
- poj 2533 Longest Ordered Subsequence(dp)
- POJ_2533 Longest Ordered Subsequence(DP)
- POJ2533-Longest Ordered Subsequence(dp)
- Longest Ordered Subsequence--dp水题
- ZOJ2136 Longest Ordered Subsequence【DP】
- zoj 2136 Longest Ordered Subsequence(DP经典~)
- POJ 2533 Longest Ordered Subsequence (DP,最长递增序列)
- POJ 2533-Longest Ordered Subsequence(DP:LIS)
- poj2533--Longest Ordered Subsequence(dp:最长上升子序列)
- POJ 2533 Longest Ordered Subsequence(dp LIS)
- POJ 2533 Longest Ordered Subsequence(基础DP)
- POJ 2533 Longest Ordered Subsequence (DP)【 LIS】
- SparseArray源码解析
- ADO.NET 快速入门(九):使用关系型数据
- Spring+Hibernate实现分页功能
- GDOI第四轮模拟总结
- 认识推送
- Longest Ordered Subsequence(dp)
- 建立和运行包含多个文件的程序的方法
- 初学命令(6)
- Vmware安装Centos NAT方式设置静态IP 并可以上网
- jfreechart 时间序列图
- 背包dp模板
- [IOS APP]文学之美
- POJ 1201 Intervals <差分约束系统 + SPFA / 贪心 + 树状数组>
- ADO.NET 快速入门(十):过滤数据