首页 > 代码库 > poj 1836 Alignment

poj 1836 Alignment

2024-07-05 09:56:32   224人阅读

Alignment
Time Limit: 1000MS Memory Limit: 30000K
Total Submissions: 12571 Accepted: 4021

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

求一列数从中间到两端严格递减的最长数目。

分别求出这列数从左到右和从右到左的最长递增子序列。

然后得到从中间到两端递减的最长序列。

#include"stdio.h"
#include"string.h"
#define mmax(a,b) (a>b?a:b)
#define N 1050
int l[N],r[N],dp[N];
double a[N];
int main()
{
    int i,j,n;
    while(scanf("%d",&n)!=-1)
    {
        for(i=0;i<n;i++)
        {
            scanf("%lf",&a[i]);
        }
        if(n<=2)         
        {
            printf("0\n");
            continue;
        }
        memset(dp,0,sizeof(dp));
        memset(l,0,sizeof(l));      //从左到右递增
        memset(r,0,sizeof(r));      //从右到左递增
        l[0]=r[n-1]=1;
        int ans=1,num;
        for(i=0;i<n;i++)
        {
            num=0;
            for(j=0;j<i;j++)
            {
                if(a[j]<a[i]&&l[j]>num)
                {
                    num=l[j];
                }
            }
            l[i]=num+1;
        }
        for(i=n-1;i>=0;i--)
        {
            num=0;
            for(j=n-1;j>i;j--)
            {
                if(a[j]<a[i]&&r[j]>num)
                {
                    num=r[j];
                }
            }
            r[i]=num+1;
        }
        ans=0;
        for(i=0;i<n;i++)
        {
            for(j=n-1,num=0;j>i;j--)
            {
                if(a[j]<=a[i]&&r[j]>num)
                {
                    num=r[j];
                }
            }
            dp[i]=l[i]+num;
            ans=mmax(ans,dp[i]);
        }
        printf("%d\n",n-ans);
    }
    return 0;
}


联系
我们