[网络流]AcWing 2180. 最长递增子序列问题

题目：AcWing 2180. 最长递增子序列问题

分析：

拆点的题目。
pro1：经典dp，求得最长为maxx
pro2：

• 每个点只能用一次，于是拆点。
• s - > 首点的左点， 长度为maxx的末点的右点 - > t
• dp小的连向dp大的

pro3：
pro2的前两种方式的边的容量改为inf，继续增广

代码：

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;//三年竞赛一场空，不开long long见祖宗
//typedef __int128 lll;
#define print(i) cout << "debug: " << i << endl
#define close() ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define mem(a, b) memset(a, b, sizeof(a))
#define pb(a) push_back(a)
#define x first
#define y second
typedef pair<int, int> pii;
const ll mod = 1e9 + 7;
const int maxn = 1010, maxm = 1000000;
const int inf = 0x3f3f3f3f;
struct edge
{
    int ep, val, nex;
}e[maxm];
int head[maxn], tot;

void init()
{
    mem(head, -1), tot = 0;
}

void addedge(int x, int y, int val)
{
    e[tot] = {y, val, head[x]}, head[x] = tot++;
    e[tot] = {x, 0, head[y]}, head[y] = tot++;
}

int a[maxn], dp[maxn];
int n, s, t;
int depth[maxn], cur[maxn], q[maxn];

bool bfs()
{
    int hh = 0, tt = 0; q[hh] = s;
    mem(depth, -1), depth[s] = 1;
    cur[s] = head[s];
    while(hh <= tt)
    {
        int now = q[hh++];
        for(int i = head[now]; ~i; i = e[i].nex)
        {
            int ep = e[i].ep;
            if(depth[ep] == -1 && e[i].val)
            {
                depth[ep] = depth[now] + 1;
                cur[ep] = head[ep];
                if(ep == t) return true;
                q[++tt] = ep;
            }
        }
    }
    return false;
}

int dfs(int now, int flow)
{
    if(now == t) return flow;
    int res = 0;
    for(int i = cur[now]; ~i && flow; i = e[i].nex)
    {
        cur[now] = i;
        int ep = e[i].ep;
        if(depth[ep] == depth[now] + 1 && e[i].val)
        {
            int k = dfs(ep, min(flow, e[i].val));
            if(!k) depth[ep] = -1;
            e[i].val -= k, e[i ^ 1].val += k;
            res += k, flow -= k;
        }
    }
    return res;
}


int dinic()
{
    int res = 0;
    while(bfs())
        res += dfs(s, inf);
    return res;
}


int main()
{
    init();
    cin >> n;
    for(int i = 1; i <= n; i++) cin >> a[i];
    s = 0, t = 2 * n + 1;
    int maxx = 0;
    for(int i = 1; i <= n; i++)
    {
        addedge(i, i + n, 1);
        dp[i] = 1;
        for(int j = 1; j < i; j++)
            if(a[j] <= a[i])
                dp[i] = max(dp[i], dp[j] + 1);
        for(int j = 1; j < i; j++)
            if(a[j] <= a[i] && dp[j] == dp[i] - 1)
                addedge(j + n, i, 1);
        if(dp[i] == 1) addedge(s, i, 1);
        maxx = max(maxx, dp[i]);
    }
    for(int i = 1; i <= n; i++)
        if(dp[i] == maxx)
            addedge(i + n, t, 1);
    cout << maxx << endl;
    if(maxx == 1) cout << n << endl << n << endl;
    else
    {
        int res = dinic();
        cout << res << endl;
        for(int i = 0; i < tot; i += 2)
        {
            int l = e[i ^ 1].ep, r = e[i].ep;
            if(l == s && r == 1 || l == 1 && r == n + 1 || l == n && r == 2 * n || l == n * 2 && r == t)
                e[i].val = inf;
        }
        cout << res + dinic() << endl;
    }
    
}