poj1836 Alignment(Dp)
来源:互联网 发布:无线网卡隐藏mac地址 编辑:程序博客网 时间:2024/05/17 03:59
原题点这里 Time Limit: 1000MS Memory Limit: 30000K
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
题目大意
大概就是让一队士兵中一些士兵出列
让剩下的士兵向左或向右看的时候可以看到尽头
借用一张图说明一下
与合唱队形差不多的一道题,不多说,简单Dp
代码
#include<cstdio> #include<cstring> const int MAX=1005; int n,dpl[MAX],dpr[MAX]; double hi[MAX]; int main() { while(scanf("%d",&n)!=EOF) { int i,j; for(i=0; i<n; i++) { scanf("%lf",&hi[i]); } memset(dpr,0,sizeof(dpr)); memset(dpl,0,sizeof(dpl)); dpl[0]=1; for(i=1;i<n;i++) { dpl[i]=1; for(j=i-1;j>=0;j--) { if(hi[j]<hi[i]&&dpl[j]+1>dpl[i]) { dpl[i]=dpl[j]+1; } } } dpr[n-1]=1; for(i=n-2;i>=0;i--) { dpr[i]=1; for(j=i+1;j<=n-1;j++) { if(hi[j]<hi[i]&&dpr[j]+1>dpr[i]) { dpr[i]=dpr[j]+1; } } } int ans=dpl[n-1]; for(i=0;i<n-1;i++) { for(j=i+1;j<n;j++) { if(dpl[i]+dpr[j]>ans) { ans=dpl[i]+dpr[j]; } } } printf("%d\n",n-ans); } return 0; }
- poj1836(dp) Alignment
- poj1836 Alignment(Dp)
- poj1836——Alignment(dp)
- POJ1836 Alignment DP
- (POJ1836)Alignment <DP,最长上升子序列变形>
- POJ1836 Alignment DP最长队列问题
- POJ1836--Alignment
- poj1836 Alignment
- poj1836 Alignment
- poj1836 Alignment
- poj1836 Alignment
- poj1836 Alignment
- Alignment poj1836
- 【POJ1836】【Alignment】
- poj1836 Alignment
- POJ1836-Alignment
- [POJ1836]Alignment
- POJ1836 Alignment 【LIS(二分)+枚举】
- 组合数公式&Lucas大组合数
- SyncRequestProcessor事务日志记录处理器
- MAVEN,从环境搭建到项目创建
- mist安装
- Unity Shader:Waveform波形(1)-用正弦函数做闪烁效果
- poj1836 Alignment(Dp)
- Java基础总结-常用类
- JS的时间对象常用方法
- html 使表格随着内容自动适应宽度
- 不能被继承的类
- 欢迎使用CSDN-markdown编辑器
- Port WPA supplicant to RTEMS-libbsd
- 面试试题简析之综合分析现象类(1)
- 2017/8/13 星期天