POJ 1836 Alignment (双向DP)
DP poj 双向
2023-09-27 14:22:23 时间
Alignment
Description In the army, a platoon is composed by n soldiers. During the morning inspection, the soldiers are aligned in a straight line in front of the captain. The captain is not satisfied with the way his soldiers are aligned; it is true that the soldiers are aligned in order by their code number: 1 , 2 , 3 , . . . , n , but they are not aligned by their height. The captain asks some soldiers to get out of the line, as the soldiers that remain in the line, without changing their places, but getting closer, to form a new line, where each soldier can see by looking lengthwise the line at least one of the line's extremity (left or right). A soldier see an extremity if there isn't any soldiers with a higher or equal height than his height between him and that extremity.
Write a program that, knowing the height of each soldier, determines the minimum number of soldiers which have to get out of line. Input On the first line of the input is written the number of the soldiers n. On the second line is written a series of n floating numbers with at most 5 digits precision and separated by a space character. The k-th number from this line represents the height of the soldier who has the code k (1 <= k <= n).
There are some restrictions: • 2 <= n <= 1000 • the height are floating numbers from the interval [0.5, 2.5] Output The only line of output will contain the number of the soldiers who have to get out of the line.
Sample Input 8 1.86 1.86 1.30621 2 1.4 1 1.97 2.2 Sample Output 4 Source |
#include<iostream> #include<cstdio> #include<cstring> using namespace std; int n,dpl[1010],dpr[1010]; double num[1010]; int main(){ //freopen("input.txt","r",stdin); while(~scanf("%d",&n)){ for(int i=0;i<n;i++){ scanf("%lf",&num[i]); dpl[i]=dpr[i]=1; } for(int i=0;i<n;i++) for(int j=0;j<i;j++) if(num[i]>num[j] && dpl[i]<dpl[j]+1) dpl[i]=dpl[j]+1; for(int i=n-1;i>=0;i--) for(int j=n-1;j>i;j--) if(num[i]>num[j] && dpr[i]<dpr[j]+1) dpr[i]=dpr[j]+1; int ans=0; for(int i=0;i<n;i++) if(ans<dpl[i]+dpr[i]-1) ans=dpl[i]+dpr[i]-1; for(int i=0;i<n;i++) //注意新队列中间的两个身高是否相同,相同则不需要减一 for(int j=i+1;j<n;j++) if(num[i]==num[j] && ans<dpl[i]+dpr[j]) ans=dpl[i]+dpr[j]; printf("%d\n",n-ans); } return 0; }
相关文章
- poj 3280(区间dp)
- poj 2385Apple Catching(简单dp)
- 【BZOJ】1090: [SCOI2003]字符串折叠(dp)
- 【BZOJ】1096: [ZJOI2007]仓库建设(dp+斜率优化)
- 【BZOJ】1664: [Usaco2006 Open]County Fair Events 参加节日庆祝(线段树+dp)
- 【BZOJ】1672: [Usaco2005 Dec]Cleaning Shifts 清理牛棚(dp/线段树)
- POJ 3691 DNA repair (DP+AC自动机)
- POJ 1947 - Rebuilding Roads 树型DP(泛化背包转移)..
- [LightOJ 1018]Brush (IV)[状压DP]
- hdu 2859 (二维dp)
- Trade-----HDU3401----单调队列优化的DP
- fzu1977之插头DP
- Strategic game POJ - 1463 树型dp
- P1439 【模板】最长公共子序列(DP)
- HDU 4832 Chess (DP)
- 1629 - Cake slicing(DP)
- POJ 2342 树形DP入门题
- POJ--2923--Relocation--如压力DP
- CF 148D. Bag of mice (可能性DP)
- Easy 2048 Again - ZOJ 3802 像缩进dp
- 数位dp(求1-n中数字1出现的个数)
- czy的后宫——矩阵快速幂优化DP
- 【LOJ 3378】点格棋(DP)(推论)
- 【SSL 1534】森林冰火人(DP)
- 【luogu P6419】Kamp(换根DP)