ZOJ 2136 Longest Ordered Subsequence(简单DP)
来源:互联网 发布:网站关键词优化智搜宝 编辑:程序博客网 时间:2024/05/01 03:00
用dp的思想,不难。
然后坑我的一点就是,dp[1]=1这个,要写在for循环外面,不然一直WA,卡了我n久。。。。玄学。。。
要多写dp~fighting~
ps:这个题解法可以优化到nlogn
#include <cstdio>#include <cstdlib>#include <cstring>#include <iostream>using namespace std;int arr[1006];int dp[1006];int main(void) { int N, n, Max, res; scanf("%d", &N); while (N--) { memset(arr, 0, sizeof(arr)); memset(dp, 0, sizeof(dp)); scanf("%d", &n); for (int i = 1; i <= n; i++) { scanf("%d", &arr[i]); } dp[1] = 1; for (int i = 2; i <= n; i++) { Max = 0; for (int j = 1; j < i; j++) { if (arr[i] > arr[j]) { Max = max(dp[j], Max); } } dp[i] = Max + 1; } res = 0; for (int i = 1; i <= n; i++) { if (res < dp[i]) res = dp[i]; } printf("%d\n", res); if (N) printf("\n"); } return 0;}
阅读全文
0 0
- ZOJ 2136 Longest Ordered Subsequence(简单DP)
- ZOJ 2136 Longest Ordered Subsequence 【DP】
- zoj 2136 Longest Ordered Subsequence(DP经典~)
- ZOJ 2136 Longest Ordered Subsequence
- zoj 2136 Longest Ordered Subsequence
- zoj 2136 - Longest Ordered Subsequence
- ZOJ 2136Longest Ordered Subsequence
- ZOJ 2136(Longest Ordered Subsequence)
- ZOJ 1136 Longest Ordered Subsequence DP
- Longest Ordered Subsequence(dp)
- Longest Ordered Subsequence(dp)
- Longest Ordered Subsequence (dp)
- Longest Ordered Subsequence [dp]
- Longest Ordered Subsequence --DP
- ZOJ 2136 Longest Ordered Subsequence(LIS)
- ZOJ Problem Set - 2136 Longest Ordered Subsequence
- POJ 2533-Longest Ordered Subsequence(DP)
- poj 2533 Longest Ordered Subsequence(dp)
- 任岁月变迁,我心不惊
- KazaQ's Socks——个人c++解
- frontend 进化史
- JQuery+JQuery ui实现的弹出窗口
- DbUtils,一个替代JDBC的小工具类
- ZOJ 2136 Longest Ordered Subsequence(简单DP)
- java面试基础2
- Python:正则表达式(三)-re模块的内容
- js中生成json对象
- Day-01
- .net core 借助容联云实现短信验证码
- 51Nod-1832-先序遍历与后序遍历
- POJ1995 Raising Modulo Numbers(快速幂取模,模板题)
- 没有上司的舞会 树形DP 经典题目