2. 程式人生 > >存一個網絡流模板

存一個網絡流模板

阿新 • • 發佈：2017-09-15
logs stream ring %d bre div const esp pri 

#include<iostream>
#include<cstdio>
#include<cstring>
#include<queue>
using namespace std;
int point[2100], next[2000003], v[2000003], remain[2000003];
int deep[2100], cur[2100], num[2100], n, m, tot, ans, laste[2100];
int a[2100], f[2100];
const int inf = 1e9;
void add(int x, int y, int z)
{
    tot++; next[tot] = point[x]; point[x] = tot; v[tot] = y; remain[tot] = z;
    tot
 
++; next[tot] = point[y]; point[y] = tot; v[tot] = x; remain[tot] = 0;
}
int adde(int s, int t)
{
    int now = t, minn = inf;
    while (now != s)
    {
        minn = min(minn, remain[laste[now]]);
        now = v[laste[now] ^ 1];
    }
    now = t;
    while (now != s)
    {
        remain[laste[now]] 
 
-= minn;
        remain[laste[now] ^ 1] += minn;
        now = v[laste[now] ^ 1];
    }
    return minn;
}
void bfs(int s, int t)
{
    for (int i = s; i <= t; i++)
        deep[i] = t + 2;
    deep[t] = 0;
    queue<int> p;
    p.push(t);
    while (!p.empty())
    {
        int now = p.front(); p.pop();
        
 
for (int i = point[now]; i != -1; i = next[i])
            if (deep[v[i]] == t + 2 && remain[i ^ 1])
            {
                deep[v[i]] = deep[now] + 1;
                p.push(v[i]);
            }
    }
}
int isap(int s, int t)
{
    int flow = 0, now = s;
    bfs(s, t);
    memset(num, 0, sizeof(num));
    for (int i = s; i <= t; i++)  num[deep[i]]++;
    for (int i = s; i <= t; i++)  cur[i] = point[i];
    while (deep[s] <= t)
    {
        if (now == t)
        {
            flow += adde(s, t);
            now = s;
        }
        bool hasfind = false;
        for (int i = cur[now]; i != -1; i = next[i])
        {
            if (deep[v[i]] + 1 == deep[now] && remain[i])
            {
                hasfind = true;
                cur[now] = i;
                laste[v[i]] = i;
                now = v[i];
                break;
            }
        }
        if (!hasfind)
        {
            int minn = t;
            for (int i = point[now]; i != -1; i = next[i])
                if (remain[i])
                    minn = min(minn, deep[v[i]] + 1);
            if (!--num[deep[now]]) break;
            deep[now] = minn;
            num[minn]++; cur[now] = point[now];
            if (now != s)
                now = v[laste[now] ^ 1];
        }
    }
    return flow;
}
void solve1()
{
    for (int i = 1; i <= n; i++)
    {
        if (f[i] == 1)  add(0, i, 1);
        if (f[i] == ans) add(i + n, 2 * n + 1, 1);
        add(i, i + n, 1);
    }
    for (int i = 2; i <= n; i++)
    {
        for (int j = 1; j < i; j++)
            if (f[i] == f[j] + 1 && a[i] >= a[j])
                add(j + n, i, 1);
    }
    if (ans == 1) printf("%d\n", n);
    else
        printf("%d\n", isap(0, 2 * n + 1));
}
void solve2()
{
    tot = -1; memset(next, -1, sizeof(next)); memset(point, -1, sizeof(point));
    for (int i = 1; i <= n; i++)
    {
        int v = 1;
        if (i == 1 || i == n) v = inf;
        if (f[i] == 1) add(0, i, v);
        if (f[i] == ans) add(i + n, 2 * n + 1, v);
        add(i, i + n, v);
    }
    for (int i = 2; i <= n; i++)
    {
        for (int j = 1; j < i; j++)
            if (f[i] == f[j] + 1 && a[i] >= a[j])
                add(j + n, i, 1);
    }
    if (ans == 1) printf("%d\n", n);
    else
        printf("%d\n", isap(0, 2 * n + 1));
}
int main()
{
    tot = -1; memset(next, -1, sizeof(next)); memset(point, -1, sizeof(point));
    scanf("%d", &n);
    for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
    f[1] = 1;
    for (int i = 2; i <= n; i++)
    {
        for (int j = 1; j < i; j++)
            if (f[i] < f[j] && a[j] <= a[i])
                f[i] = f[j];
        f[i]++;
    }
    ans = 0;
    for (int i = 1; i <= n; i++)
        ans = max(ans, f[i]);
    printf("%d\n", ans);
    solve1();
    solve2();
}

#include<iostream>#include<cstdio>#include<cstring>#include<queue>using namespace std;int point[2100], next[2000003], v[2000003], remain[2000003];int deep[2100], cur[2100], num[2100], n, m, tot, ans, laste[2100];int a[2100], f[2100];const int inf = 1e9;void add(int x, int y, int z){tot++; next[tot] = point[x]; point[x] = tot; v[tot] = y; remain[tot] = z;tot++; next[tot] = point[y]; point[y] = tot; v[tot] = x; remain[tot] = 0;}int adde(int s, int t){int now = t, minn = inf;while (now != s){minn = min(minn, remain[laste[now]]);now = v[laste[now] ^ 1];}now = t;while (now != s){remain[laste[now]] -= minn;remain[laste[now] ^ 1] += minn;now = v[laste[now] ^ 1];}return minn;}void bfs(int s, int t){for (int i = s; i <= t; i++)deep[i] = t + 2;deep[t] = 0;queue<int> p;p.push(t);while (!p.empty()){int now = p.front(); p.pop();for (int i = point[now]; i != -1; i = next[i])if (deep[v[i]] == t + 2 && remain[i ^ 1]){deep[v[i]] = deep[now] + 1;p.push(v[i]);}}}int isap(int s, int t){int flow = 0, now = s;bfs(s, t);memset(num, 0, sizeof(num));for (int i = s; i <= t; i++) num[deep[i]]++;for (int i = s; i <= t; i++) cur[i] = point[i];while (deep[s] <= t){if (now == t){flow += adde(s, t);now = s;}bool hasfind = false;for (int i = cur[now]; i != -1; i = next[i]){if (deep[v[i]] + 1 == deep[now] && remain[i]){hasfind = true;cur[now] = i;laste[v[i]] = i;now = v[i];break;}}if (!hasfind){int minn = t;for (int i = point[now]; i != -1; i = next[i])if (remain[i])minn = min(minn, deep[v[i]] + 1);if (!--num[deep[now]]) break;deep[now] = minn;num[minn]++; cur[now] = point[now];if (now != s)now = v[laste[now] ^ 1];}}return flow;}void solve1(){for (int i = 1; i <= n; i++){if (f[i] == 1) add(0, i, 1);if (f[i] == ans) add(i + n, 2 * n + 1, 1);add(i, i + n, 1);}for (int i = 2; i <= n; i++){for (int j = 1; j < i; j++)if (f[i] == f[j] + 1 && a[i] >= a[j])add(j + n, i, 1);}if (ans == 1) printf("%d\n", n);elseprintf("%d\n", isap(0, 2 * n + 1));}void solve2(){tot = -1; memset(next, -1, sizeof(next)); memset(point, -1, sizeof(point));for (int i = 1; i <= n; i++){int v = 1;if (i == 1 || i == n) v = inf;if (f[i] == 1) add(0, i, v);if (f[i] == ans) add(i + n, 2 * n + 1, v);add(i, i + n, v);}for (int i = 2; i <= n; i++){for (int j = 1; j < i; j++)if (f[i] == f[j] + 1 && a[i] >= a[j])add(j + n, i, 1);}if (ans == 1) printf("%d\n", n);elseprintf("%d\n", isap(0, 2 * n + 1));}int main(){tot = -1; memset(next, -1, sizeof(next)); memset(point, -1, sizeof(point));scanf("%d", &n);for (int i = 1; i <= n; i++) scanf("%d", &a[i]);f[1] = 1;for (int i = 2; i <= n; i++){for (int j = 1; j < i; j++)if (f[i] < f[j] && a[j] <= a[i])f[i] = f[j];f[i]++;}ans = 0;for (int i = 1; i <= n; i++)ans = max(ans, f[i]);printf("%d\n", ans);solve1();solve2();}

存一個網絡流模板

相關推薦

存一個網絡流模板

logs stream ring %d bre div const esp pri #include<iostream> #include<cstdio> #include<cstring> #include<queue>

網絡流模板

pop while size color include blog pan == its #include<bits/stdc++.h> using namespace std; #define M 10001 #define inf 100000 int i

算法復習——網絡流模板（ssoj）

ddd tde res csr dpf ada spi gyp clj 題目： 題目描述 有 n（0<n<=1000）個點，m（0<m<=1000）條邊，每條邊有個流量 h（0<=h<35000），求從點 start 到點 end 的最

網絡流模板（Dinic）

edge str tput nod ack getc prior ext freopen 1 #include<iostream> 2 #include<algorithm> 3 #include<cstdio> 4 #incl

上下界網絡流模板

long long return ins hid ring ace vector ide using 無源匯上下界可行流 1 #include<iostream> 2 #include<cstdio> 3 #include&

（hdu-4280）Island Transport~測試網絡流模板速度~要加掛才能過啊

south please mon ron follow incr dep 還要 att Problem Description 　　In the vast waters far far away, there are many islands. People are l

網絡流模板們

namespace clas col bsp spl cto pla continue alt 最大流EK： 1 #include <vector> 2 #include <cstdio> 3 #include <cstri

C#流總結(文件流、內存流、網絡流、BufferedStream、StreamReader/StreamWriter、TextReader/TextWriter)

accept ron 格式 初始 oar listener style ble 流數據 一、文件流FileStream類主要用於讀寫磁盤文件。常用於向磁盤存儲數據或讀取配置文件。讀取文件：復制代碼 //文件流：讀取 FileStream fileStream = F

POJ 1273 Drainage Ditches (網絡流Dinic模板)

maximum between for cover which contain beginning algorithm tor Description Every time it rains on Farmer John‘s fields, a pond forms ove

網絡流最大流模板（洛谷3376）——Dinic

pen crt const || div color ini 技術分享 消息 　　小道消息，據說NOIP 2017 的六個題是三位（前？）國家隊大神出的，所以難度很有可能賊高，並且可能出現網絡流，所以慌慌張張地來打了個Dinic 模板，但願汝佳所說“在大多數比賽

模板：網絡流最大流

pty ++ 網絡 turn 算法 sizeof 模板 urn ems Edmonds-Karp算法： 1 //Edmonds-Karp算法 2 3 const int INF=0x3f3f3f3f; 4 int n,m,s,t,Map[N][N],p

【網絡流基礎模板】

oid 最大 建立 sizeof front 最大匹配 queue ext style //網絡流dinic //最大流=最小割 //基本建模 //建源匯,向每個點分別連所限制的邊權，題目所給的邊連inf int cnt=1; inline void insert(

網絡流-最大流 Dinic模板

continue main con min ont can cto bsp color 1 #include <bits/stdc++.h> 2 3 using namespace std; 4 5 #define MP make_pa

P3386 【模板】二分圖匹配 -網絡流

二分圖最大匹配 兩個 遇到 tin 思路 otto ext void copy 　　　　　　　　　　　　二分圖匹配 題目背景 二分圖 感謝@一扶蘇一 提供的hack數據 題目描述 給定一個二分圖，結點個數分別為n,m，邊數為e，求二分圖最大匹配數 輸入輸出格式

網絡流最大流模板

ase with pop sca pan using oid cst unsigned 題目鏈接： http://poj.org/problem?id=1273 #include<iostream> #include<cstdio> #includ

[模板] 二分圖/網絡流相關定理

可以轉化 最大獨立集 獨立 集中 解釋 方案 模板 psd one 待更 最小點集覆蓋==最大匹配。在這裏解釋一下原因，首先，最小點集覆蓋一定>=最大匹配，因為假設最大匹配為n，那麽我們就得到了n條互不相鄰的邊，光覆蓋這些邊就要用到n個點。現在我們來思考為什麽最小點

模板 ISAP網絡流+GAP優化+弧優化

include sin set 網絡流 n+1 c++ 優化 () esp //ISAP+GAP優化+弧優化 #include <bits/stdc++.h> #define H cout<<"HYX"<<endl;

網絡流相關模板及結論

ext 增廣路 max ora col 網絡流 maximum div cor 一、一些結論 　　1.最大流最小割定理(Maximum Flow, Minimum Cut Theorem):網絡的最大流等於最小割 　　2.任意一個流都小於等於任意一個割（廢話）

[模板] 上下界網絡流

根據 問題 及其 += 刪掉 沒有 上下 網絡流 否則 上下界 上下界網絡流指的是邊的流量有上下界的一類網絡流問題. 網絡流 無源匯可行流 無源匯顯然沒有最大流:P 對於邊 \((u, v, [l, r])\), 連邊 \((u, v, r-l)\), 並且記錄 \(v_u

模板 - 網絡流 - 最大流

nbsp struct std for esp 添加 bool bfs 模板 註意網絡流的邊的上限是兩倍，因為要有反向邊。 註意最後傳入的n在最新版本中一般傳入t（假如t是最後一個節點的話，或者不傳入）就可以了。 使用前要先init()，再添加addedge()。