【bzoj2718】[Violet 4]毕业旅行 最长反链

Description

Input

Output

最多可选多少景点

Sample Input

7 6

1 2

2 3

5 4

4 3

3 6

6 7

Sample Output

2

题解
http://vfleaking.blog.163.com/blog/static/1748076342012918105514527/

代码

#include<bits/stdc++.h>
#define ll long long
#define inf 1000000000
#define mod 1000000007
using namespace std;
inline int read()
{
    int x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if (ch=='-') f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
    return x*f;
}
int n,m,ans,f[205][205],match[205],T,flag[205];
bool find(int now)
{
    for (int i=1;i<=n;i++)
    {
        if (!f[now][i]) continue;
        if (flag[i]==T) continue;
        flag[i]=T;
        if (!match[i]||find(match[i]))
        {
            match[i]=now;
            return 1;
        }
    }
    return 0;
}
int main()
{
    n=read();m=read();
    for (int i=1;i<=m;i++)
    {
        int x=read(),y=read();
        f[x][y]=1;
    }
    for (int k=1;k<=n;k++)
        for (int i=1;i<=n;i++)
            for (int j=1;j<=n;j++)
                if (f[i][k]&&f[k][j]) f[i][j]=1;
    for (int i=1;i<=n;i++)
    {
        T=i;if (find(i)) ans++;
    }
    printf("%d",n-ans);
    return 0;
}