ACM: 最长升序和最长降序 dp题 poj…
来源:互联网 发布:深圳阿里云大厦 编辑:程序博客网 时间:2024/06/10 19:28
Description
In the army, a platoon is composed by nsoldiers. During the morning inspection, the soldiers are alignedin a straight line in front of the captain. The captain is notsatisfied with the way his soldiers are aligned; it is true thatthe soldiers are aligned in order by their code number: 1 , 2 , 3 ,. . . , n , but they are not aligned by their height. The captainasks some soldiers to get out of the line, as the soldiers thatremain in the line, without changing their places, but gettingcloser, to form a new line, where each soldier can see by lookinglengthwise the line at least one of the line's extremity (left orright). A soldier see an extremity if there isn't any soldiers witha higher or equal height than his height between him and thatextremity.
Write a program that, knowing the height ofeach soldier, determines the minimum number of soldiers which haveto get out of line.
Input
On the first line of the input is written thenumber of the soldiers n. On the second line is written a series ofn floating numbers with at most 5 digits precision and separated bya space character. The k-th number from this line represents theheight 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 thenumber 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
题意: 士兵站队列.要求至少的多少个出队列满足当前第i个士兵可以看到全部左边的队友或则全部右边的队友.
解题思路:
代码:
#include<cstdio>
#include<iostream>
#include<cstring>
using namespace std;
#define MAX 1005
int n;
double a[MAX];
int dp1[MAX];
int dp2[MAX];
int main()
{
//
}
- ACM: 最长升序和最长降序 dp题 poj…
- ACM: 最长子序 dp题 poj 2533
- ACM: 最长公共子序 poj 1458
- ACM: 回文串 dp题 poj 1159 (滚动…
- ACM: dp动态规划题(难) poj 3267 …
- ACM: dp题(动态规划) poj 2151 (d…
- ACM: 树状DP 动态规划题 poj 1463 …
- ACM: dp题 poj 1276 go on 动态规…
- ACM: DP训练好题 动态规划题 poj 1…
- ACM: DP+floyd 动态规划题 poj 117…
- ACM: dp题 --> 背包问题 poj 1837
- ACM: 动态规划题 poj 2057 树状DP
- ACM: 搜索题 poj 1…
- ACM: 图论题+记忆DP poj 2662 (边…
- ACM: 简单数塔题 dp题 poj 3176
- ACM: 最优解 dp题 poj 1260
- ACM: 概率DP 动态规划题 poj 1322
- ACM: 动态规划题 poj 1192 树形DP
- ACM: 模拟题 poj 2632 (开始做模拟…
- hdu_4714_Tree2cycle(树形DP)
- ACM: 最长子序 dp题 poj 2533
- ACM: 简单数塔题 dp题 poj 3176
- ACM: 最优解 dp题 poj 1260
- ACM: 最长升序和最长降序 dp题 poj…
- ACM: dp动态规划题(难) poj 3267 …
- ACM: dp题 poj 1276 go on 动态规…
- ACM: dp题 --> 背包问题 poj 1837
- ACM: dp题(动态规划) poj 2151 (d…
- ACM: hash题 poj 3274 (题目看了好…
- ACM: 模拟题 poj 2993
- ACM: 有难度的深搜题 poj 3373
- ACM: 条件最短路 poj 1724 (没剪枝…