poj2699

#include<cstdio>
#include<cmath>
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdlib>
#include<queue>
using namespace std;
const int maxn=1000,maxm=11000,inf=0x7fffffff;
int n,m,a,b,c,s,t,tot=1,maxflow,k[maxn],head[maxn],cur[maxn],h[maxn];
queue<int> q;
char ss[maxn];
struct node{
    int go,next,v;
}e[maxm];
inline int read(){
    int x=0,f=1;char ch=getchar();
    while (ch>‘9‘ || ch<‘0‘){if (ch==‘\n‘) return -323;ch=getchar();}
    while (ch>=‘0‘ && ch<=‘9‘){x=x*10+ch-‘0‘;ch=getchar();}
    return x*f;
}
inline void addedge(int x,int y,int v){
    e[++tot]=(node){y,head[x],v};head[x]=tot;
    e[++tot]=(node){x,head[y],0};head[y]=tot;
}
bool bfs(){
    for (int i=1;i<=t;i++) h[i]=-1;
    q.push(s);h[s]=0;
    while (!q.empty()){
        int x=q.front();q.pop();
        for (int i=head[x];i;i=e[i].next){
            if (e[i].v&&h[e[i].go]==-1){
                h[e[i].go]=h[x]+1;
                q.push(e[i].go);
            }
        }
    }
    return h[t]!=-1;
}
int dfs(int x,int f){
    if (x==t) return f;
    int tmp,used=0;
    for (int i=cur[x];i;i=e[i].next){
        if (e[i].v&&h[e[i].go]==h[x]+1){
            tmp=dfs(e[i].go,min(e[i].v,f-used));
            e[i].v-=tmp;if (e[i].v) cur[x]=i;
            e[i^1].v+=tmp;used+=tmp;
            if (used==f) return f;
        }
    }
    if (!used) h[x]=-1;
    return used;
}
void dinic(){
    maxflow=0;
    while (bfs()){
        for (int i=1;i<=t;i++) cur[i]=head[i];
        maxflow+=dfs(s,inf);
    }
}
int main(){
    n=read();
    while (n--){
        m=0;
        //神读入 
        gets(ss);
        int x=0,l=strlen(ss);
        for (int i=0;i<l;i++){
            if (ss[i]>=‘0‘ && ss[i]<=‘9‘){
                x=x*10+ss[i]-‘0‘;
                if (i==l-1 || ss[i+1]==‘ ‘) k[++m]=x,x=0;
            }
        }
        
        s=m+1;t=500;c=m*(m-1)/2;
        for (int i=m;i;i--){
//            cout<<"i:"<<i<<endl;
            tot=1;
            memset(head,0,sizeof(head));
            for (int j=1;j<=m;j++) addedge(s,j,k[j]);
            for (int j=1;j<m;j++)
                for (int w=j+1;w<=m;w++){
                    addedge(j*m+w,t,1);
                    if (j<i || w<i || k[j]==k[w]) addedge(j,j*m+w,1),addedge(w,j*m+w,1);
                }
            for (int j=i;j<m;j++)
                for (int w=j+1;w<=m;w++) if (k[j]<k[w]) addedge(j,j*m+w,1);
            dinic();
//            cout<<maxflow<<endl;
            if (maxflow!=c){
                printf("%d\n",m-i);
                break;
            }
            if (i==1) printf("%d\n",m);
        }
    }
    return 0;
}