网络流二十四题之最长非递减子序列（未完成）

这道题还有点问题，打算以后再解决。
先说下建模吧，问题一只需要用dp做就行。下一步的建模方法如下：
1.所有dp值为1的点，增加一条到源点的边，代表一个序列的起始点
2.所有dp值位上一部求出来的答案的点，增加一条到汇点的边，代表一个序列的结束，其他答案的点不会连接到源点。
3.对于i

#include <iostream>
#include <cstdio>
#include <bits/stdc++.h>
const int MAXN = 100010;//点数的最大值
const int MAXM = 400010;//边数的最大值
const int INF = 0x3f3f3f3f;
using namespace std;
struct Edge
{
    int to,next,cap,flow,from;
} edge[MAXM]; //注意是MAXM
int tol;
int head[MAXN];
int gap[MAXN],dep[MAXN],cur[MAXN];
void init()
{
    tol = 0;
    memset(head,-1,sizeof(head));
}
void addedge(int u,int v,int w,int rw = 0)
{
    edge[tol].to = v;
    edge[tol].cap = w;
    edge[tol].from = u;
    edge[tol].flow = 0;
    edge[tol].next = head[u];
    head[u] = tol++;
    edge[tol].to = u;
    edge[tol].from = v;
    edge[tol].cap = rw;
    edge[tol].flow = 0;
    edge[tol].next = head[v];
    head[v] = tol++;
}
int Q[MAXN];
void BFS(int start,int end)
{
    memset(dep,-1,sizeof(dep));
    memset(gap,0,sizeof(gap));
    gap[0] = 1;
    int front = 0, rear = 0;
    dep[end] = 0;
    Q[rear++] = end;
    while(front != rear)
    {
        int u = Q[front++];
        for(int i = head[u]; i != -1; i = edge[i].next)
        {
            int v = edge[i].to;
            if(dep[v] != -1)
                continue;
            Q[rear++] = v;
            dep[v] = dep[u] + 1;
            gap[dep[v]]++;
        }
    }
}
int S[MAXN];
int sap(int start,int end,int N)
{
    BFS(start,end);
    memcpy(cur,head,sizeof(head));
    int top = 0;
    int u = start;
    int ans = 0;
    while(dep[start] < N)
    {
        if(u == end)
        {
            int Min = INF;
            int inser;
            for(int i = 0; i < top; i++)
                if(Min > edge[S[i]].cap - edge[S[i]].flow)
                {
                    Min = edge[S[i]].cap - edge[S[i]].flow;
                    inser = i;
                }
            for(int i = 0; i < top; i++)
            {
                edge[S[i]].flow += Min;
                edge[S[i]^1].flow -= Min;
            }
            ans += Min;
            top = inser;
            u = edge[S[top]^1].to;
            continue;
        }
        bool flag = false;
        int v;
        for(int i = cur[u]; i != -1; i = edge[i].next)
        {
            v = edge[i].to;
            if(edge[i].cap - edge[i].flow && dep[v]+1 == dep[u])
            {
                flag = true;
                cur[u] = i;
                break;
            }
        }
        if(flag)
        {
            S[top++] = cur[u];
            u = v;
            continue;
        }
        int Min = N;
        for(int i = head[u]; i != -1; i = edge[i].next)
            if(edge[i].cap - edge[i].flow && dep[edge[i].to] < Min)
            {
                Min = dep[edge[i].to];
                cur[u] = i;
            }
        gap[dep[u]]--;
        if(!gap[dep[u]])
            return ans;
        dep[u] = Min + 1;
        gap[dep[u]]++;
        if(u != start)
            u = edge[S[--top]^1].to;
    }
    return ans;
}
void print_all_edge()
{
    for(int i = 0; i < tol ; i += 2)
    {
        printf("%d -> %d cap: % d,flow: %d\n",edge[i].from,edge[i].to,edge[i].cap,edge[i].flow);
    }
}
inline bool getint(int &num)
{
    char in;
    bool IsN=false;
    in=getchar();
    if(in==EOF || in == '\n')
        return false;
    while(in!='-'&&(in<'0'||in>'9'))
        in=getchar();
    if(in=='-')
    {
        IsN=true;
        num=0;
    }
    else
        num=in-'0';
    while(in=getchar(),in>='0'&&in<='9')
    {
        num*=10,num+=in-'0';
    }
    if(IsN)
        num=-num;
    if(in == '\n')
        return false;
    return true;
}
int st = 0,en = 1505;
int T = 505;
int dp[MAXN];
int a[MAXN];
int main()
{
    int n;
    cin>>n;
    for(int i = 1;i<=n;i++)
    {
        cin>>a[i];
        dp[i] = 1;
    }
    int ans1 = 0;
    for(int i =1;i<=n;i++)
    {
        for(int j = 1;j<=i;j++)
        {
            if(a[j] < a[i] )
            {
                dp[i] = max(dp[j]+1,dp[i]);
            }
        }
        ans1 = max(ans1,dp[i]);
       //cout<<dp[i]<<endl;
    }
    init();
    cout<<ans1<<endl;
    for(int i = 1;i<=n;i++)
    {
        addedge(i,i+n,1);
        if(dp[i] == 1) addedge(0,i,1);
        if(dp[i] == ans1) addedge(i+n,2*n+1,1);
    }
    for(int i = 1;i<=n;i++)
    {
        for(int j = 1;j<i;j++)
        {
            if(a[j] < a[i] && dp[j] +1 == dp[i])
            {
                addedge(j,i+n,1);
                addedge(i,j+n,1);
            }
        }
    }
    int ans2 = sap(0,2*n+1,2*n+3);
    print_all_edge();
    cout<<ans2<<endl;
    init();

    for(int i = 1;i<=n;i++)
    {
        if(i == 1 ||i == n)
        {
            if(dp[i] == 1) addedge(0,i,INF);
            addedge(i,i+n,INF);
            if(dp[i] == ans1) addedge(i+n,2*n+1,INF);
        }
        else
        {
            if(dp[i] == 1) addedge(0,i,1);
            addedge(i,i+n,1);
            if(dp[i] == ans1) addedge(i+n,2*n+1,1);
        }
    }
    for(int i = 1;i<=n;i++)
    {
        for(int j = 1;j<i;j++)
        {
            if(a[j] < a[i] && dp[j] +1 == dp[i])
            {
                 addedge(j,i+n,1);
            }
        }
    }
    int ans3 = sap(0,2*n+1,2*n+3);
    //print_all_edge();
    cout<<ans3<<endl;
    return 0;
}