poj3670

最新推荐文章于 2022-03-09 00:53:22 发布

weixin_34192993

最新推荐文章于 2022-03-09 00:53:22 发布

阅读量55

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/eric-blog/archive/2012/08/19/2646885.html

Eating Together

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 4548		Accepted: 2220

Description

The cows are so very silly about their dinner partners. They have organized themselves into three groups (conveniently numbered 1, 2, and 3) that insist upon dining together. The trouble starts when they line up at the barn to enter the feeding area.

Each cow i carries with her a small card upon which is engraved D_i(1 ≤ D_i≤ 3) indicating her dining group membership. The entire set of N (1 ≤ N ≤ 30,000) cows has lined up for dinner but it's easy for anyone to see that they are not grouped by their dinner-partner cards.

FJ's job is not so difficult. He just walks down the line of cows changing their dinner partner assignment by marking out the old number and writing in a new one. By doing so, he creates groups of cows like 111222333 or 333222111 where the cows' dining groups are sorted in either ascending or descending order by their dinner cards.

FJ is just as lazy as the next fellow. He's curious: what is the absolute mminimum number of cards he must change to create a proper grouping of dining partners? He must only change card numbers and must not rearrange the cows standing in line.

Input

* Line 1: A single integer: N
* Lines 2..N+1: Line i describes the i-th cow's current dining group with a single integer: D_i

Output

* Line 1: A single integer representing the minimum number of changes that must be made so that the final sequence of cows is sorted in either ascending or descending order

Sample Input

Sample Output

Source

USACO 2008 February Silver

//求最大连续序列，正向求最大上升子序列和下降子序列，
//取最大值即位,即为最大连续序列
//Lis: dp[i]=max{dp[j]}+1;  1=<j<i
//TLE*2,需要用n*logn
#include <cstdio>
#include <cstring>

using namespace std;

int n;
int sheep[30010],sheep1[30010];
int b[30010];
int sum1, sum2;
int maxSum;

int bSearch(int val, int k)
{
    int low, high, mid;

    low=1;
    high=k;

    while(low<=high)
    {
        mid=(high+low)/2;

        if(val>=b[mid])
        {
            low=mid+1;
        }
        else
        {
            high=mid-1;
        }
    }

    return low;
}

int lis(int *p)
{
    int pos,k=1;

    b[1]=p[1];
    for(int i=2; i<=n; i++)
    {
        if(p[i]>=b[k])
        {
            k++;
            b[k]=p[i];
        }
        else
        {
            pos=bSearch(p[i],k);
            b[pos]=p[i];
        }
    }
    return k;
}

int main()
{
    while(scanf("%d",&n)!=EOF)
    {
        for(int i=1; i<=n; i++)
        {
            scanf("%d",sheep+i);
            sheep1[n-i+1]=sheep[i];
        }
        //lis
        sum1=lis(sheep);
        sum2=lis(sheep1);
        maxSum=sum1>sum2?sum1:sum2;
        printf("%d\n",n-maxSum);
    }
    return 0;
}