POJ 3298 递推,DP
2011-01-14 23:55
344 查看
Antimonotonicity
Description
I have a sequence Fred of length n comprised of integers between 1 and n inclusive. The elements of Fred are pairwise distinct. I want to find a subsequence Mary of Fred that is as long as possible and has the property that:
Mary0 > Mary1 < Mary2 > Mary3 < ...
Input
The first line of input will contain a single integer T expressed in decimal with no leading zeroes. T will be at most 50. T test cases will follow.
Each test case is contained on a single line. A line describing a test case is formatted as follows:
n Fred0 Fred1 Fred2 ... Fredn-1.
where n and each element of Fred is an integer expressed in decimal with no leading zeroes. No line will have leading or trailing whitespace, and two adjacent integers on the same line will be separated by a single space. n will be at most 30000.
Output
For each test case, output a single integer followed by a newline --- the length of the longest subsequence Mary of Fred with the desired properties.
Sample Input
Sample Output
Source
Waterloo Local Contest, 2007.7.14
利用凹凸函数,依次递推。。
Source Code
Source Code
Time Limit: 2000MS | Memory Limit: 65536K | |
Total Submissions: 2428 | Accepted: 995 |
I have a sequence Fred of length n comprised of integers between 1 and n inclusive. The elements of Fred are pairwise distinct. I want to find a subsequence Mary of Fred that is as long as possible and has the property that:
Mary0 > Mary1 < Mary2 > Mary3 < ...
Input
The first line of input will contain a single integer T expressed in decimal with no leading zeroes. T will be at most 50. T test cases will follow.
Each test case is contained on a single line. A line describing a test case is formatted as follows:
n Fred0 Fred1 Fred2 ... Fredn-1.
where n and each element of Fred is an integer expressed in decimal with no leading zeroes. No line will have leading or trailing whitespace, and two adjacent integers on the same line will be separated by a single space. n will be at most 30000.
Output
For each test case, output a single integer followed by a newline --- the length of the longest subsequence Mary of Fred with the desired properties.
Sample Input
4 5 1 2 3 4 5 5 5 4 3 2 1 5 5 1 4 2 3 5 2 4 1 3 5
Sample Output
1 2 5 3
Source
Waterloo Local Contest, 2007.7.14
利用凹凸函数,依次递推。。
Source Code
Problem: 3298 | User: bingshen | |
Memory: 252K | Time: 172MS | |
Language: C++ | Result: Accepted |
#include<stdio.h> #include<string.h> int a[30005]; int main() { int i,t,n,m,ans; bool s; scanf("%d",&t); while(t--) { ans=1; scanf("%d",&n); for(i=1;i<=n;i++) scanf("%d",&a[i]); m=a[1]; s=true; for(i=2;i<=n;i++) { if(m<a[i]&&s) m=a[i]; else if(m>a[i]&&!s) m=a[i]; else if(m>a[i]&&s) { m=a[i]; s=false; ans++; } else if(m<a[i]&&!s) { m=a[i]; s=true; ans++; } } printf("%d/n",ans); } return 0; }
相关文章推荐
- poj 2096 Collecting Bugs 【概率DP】【逆向递推求期望】
- POJ 2441 Arrange the Bulls 状态压缩递推简单题 (状态压缩DP)
- POJ 1661 Help Jimmy(递推DP)
- POJ 1163 The Triangle【DP】递归和递推
- POJ 1163 The Triangle + HDU 2084 数塔(递推dp)
- [poj 3254] Corn Fields 状态压缩DP(递推)
- 动态规划(DP),递推,最大子段和,POJ(2479,2593)
- poj 1157 简单递推dp
- (DP) poj 3298
- POJ_1850_Code_DP,递推
- POJ2385 Apple Catching(DP/递推)
- poj 2506 Tiling dp 递推
- 【POJ 2955】【经典区间DP 递推写法】 Brackets 【合法括号匹配成功结果+2,求最大结果】
- 【poj 3176】 Cow Bowling 递推dp
- poj 3597 Polygon Division(dp递推)
- 【POJ 2663】Tri Tiling(dp|递推)
- POJ-2663,2506 Tri Tiling 递推 | 压缩DP
- 【POJ 3420】Quad Tiling(dp|递推 +矩阵快速幂)
- HOJ 2148&POJ 2680(DP递推,加大数运算)
- POJ 2229 Sumsets(dp 递推)