poj 1836 Alignment dp

Alignment

Time Limit: 1000MS		Memory Limit: 30000K
Total Submissions: 14488		Accepted: 4696

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

题意:去掉最少的人使得每个人都能看到两头中的一头，就是等于人是三角形排列的。

双端求lis 再从头到尾枚举一遍

#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
using namespace std;
#define Max 1024
double p[Max];
int d1[Max],d2[Max],n;
int main()
{
    cin>>n;
    for(int i=1;i<=n;i++)
        cin>>p[i];
    int res=0;d1[1]=1;
        d2[1]=1;
    for(int i=1;i<=n;i++)
    {
        int m=0;
        for(int j=1;j<i;j++)
        {
            if(p[j]<p[i]&&m<d1[j]) m=d1[j];
        }
        d1[i]=m+1;
    }
    for(int i=n;i>=1;i--)
    {
        int m=0;
        for(int j=n;j>i;j--)
        {
            if(p[j]<p[i]&&m<d2[j]) m=d2[j];
        }
        d2[i]=m+1;
    }
    for(int i=1;i<n;i++)
    {
        for(int j=i+1;j<=n;j++)
        res=max(res,d1[i]+d2[j]);
    }
    cout<<n-res<<endl;
    return 0;
}

还有一种就是枚举端点的位置再判断两头的最长不下降子序列，得用n*logn的时间复杂度的lis

随时更新一个不下降的子序列，对于每个新加入的元素，二分查找他的位置，加入

#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
using namespace std;
#define Max 1024
double p[Max];
double lis[Max],lds[Max];
int n;
int search_lis(double a[],int left,int right,double val)
{
    int mid=(left+right)/2;
    int r=right;int l=left;
    while(l<r)
    {
        if(a[mid]==val) return mid;
        else if(a[mid]>val)
        {
            r=mid;
            mid=(l+r)/2;
        }
        else
        {
            l=mid+1;
            mid=(l+r)/2;
        }
    }
    return l;
}

int search_lds(double a[],int left,int right,double val)
{
    int mid=(left+right)/2;
    int r=right;int l=left;
    while(l<r)
    {
        mid=(l+r)/2;
        if(a[mid]==val) return mid;
        else if(a[mid]<val)
        {
            r=mid;
        }
        else
        {
            l=mid+1;
        }
    }
    return l;
}

int main()
{
    cin>>n;
    int res=0;
    for(int i=1;i<=n;i++) cin>>p[i];
    for(int m=1;m<=n;m++)
    {
        int len_lis=1;
        for(int i=1;i<=m;i++)
        {
            lis[len_lis]=23333;
            int k=search_lis(lis,1,len_lis,p[i]);
            if(k==len_lis) len_lis++;lis[k]=p[i];
        }
        len_lis--;
        int len_lds=1;
        lis[m]=233;
        for(int i=m+1;i<=n;i++)
        {
            lis[m+len_lds]=-1;
            int k=search_lds(lis,m,m+len_lds,p[i]);
            if(k==m+len_lds) {len_lds++;}lis[k]=p[i];
        }
        len_lds--;
        res=max(res,len_lis+len_lds);
    }
    cout<<n-res<<endl;
    return 0;
}