Alignment
Time Limit: 1000MS | Memory Limit: 30000K | |
Total Submissions: 17345 | Accepted: 5697 |
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.
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]
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
tips:其实没有看懂题目意思,网上搜了下题解。就是问最少踢掉多少人之后,就可以往左往右都能看到尽头。
实际上就是形成一个中间最高,两边最低的序列。
分别从两边计算最长非下降子序列。
#include<iostream> #include<cstring> using namespace std; const int maxn=1100; int n; double h[maxn]; int dp1[maxn],dp2[maxn]; int main() { cin>>n; for(int i=1;i<=n;i++)cin>>h[i]; for(int i=1;i<=n;i++)dp1[i]=1,dp2[i]=1; for(int i=1;i<=n;i++) { for(int j=1;j<i;j++) { if(h[i]>h[j]){ dp1[i]=max(dp1[i],dp1[j]+1); } } } for(int i=n;i>=1;i--) { for(int j=n;j>i;j--) { if(h[i]>h[j]){ dp2[i]=max(dp2[i],dp2[j]+1); } } } int ans=0; for(int i=1;i<n;i++) for(int j=i+1;j<=n;j++) ans=max(ans,dp1[i]+dp2[j]); cout<<n-ans<<endl; return 0; }