POJ
2015-07-16 18:49
120 查看
Language: Default Alignment
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 Romania OI 2002 |
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
#define maxn 1005
int d[2][maxn];
double a[maxn];
int n;
int main()
{
while(~scanf("%d", &n))
{
for(int i=0; i<n; i++)
scanf("%lf", &a[i]);
for(int i=0; i<n; i++)
{
d[0][i] = d[1][i] = 1;
}
for(int i=1; i<n; i++)
for(int j=0; j<i; j++)
if(a[j] < a[i])
d[0][i] = max(d[0][i], d[0][j]+1);
for(int i=n-2; i>=0; i--)
for(int j=n-1; j>i; j--)
if(a[j] < a[i])
d[1][i] = max(d[1][i], d[1][j] + 1);
int ans = -1;
for(int i=0; i<n; i++)
for(int j=i+1; j<n; j++)
ans = max(ans, d[0][i]+d[1][j]);
printf("%d\n", n - ans);
}
return 0;
}
/*
8 1.86 1.86 1.30621 2 1.4 1 1.97 2.2
*/
相关文章推荐
- HashCode有多大可能重复?
- C++ 连接Mysql数据库
- 交叉链表
- 遍历Map的四种方法
- Android初学之路(一)
- 注册中的验证码
- ThreadLocal类及常用的线程安全类探究
- 查询数据库里当前用户下的所有表的总共数据sql
- RC4加密解密算法
- The Third Day
- 重构——改善既有代码的设计 读书笔记
- windows下,通过进程名杀死进程
- 第一周第三天([算式][九九乘法表][求素数][求1000以内数相加但尾数是三的数跳出不计算][生小兔子问题] [金字塔问题] [求1+3+...+(2^20-1)的值][求1000以内的完全数])
- StringBuffer,StringBuilder,数组常见操作,Arrays,基本类型包装类--2
- python学习NO1
- UVA 12901 Refraction 几何/大雾题
- NSRange用法 oc
- JFinal 源码解析系列二
- iPhone 6/plus iOS Safari fieldset border 边框消失
- Cocos2d-x 脚本语言Lua使用