图论要是不会出数据是很难ac的,感觉很多题都这样额。。。。。
dag图就是要dfs来dp,bfs的话很慢额。。。其他都很easy。。。。就这丫
送一组数据:
1
22 21
1 2
2 3
3 4
5 2
6 5
7 6
8 7
9 4
10 9
11 10
12 11
13 3
14 13
15 14
16 15
17 16
18 17
3 19
19 20
20 21
21 22
1 2
2 3
3 4
5 2
6 5
7 6
8 7
9 4
10 9
11 10
12 11
13 3
14 13
15 14
16 15
17 16
18 17
3 19
19 20
20 21
21 22
当然你最好还要检验下是否能多次运行。
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<stack>
using namespace std;
vector<int>g[1050];
vector<int>bcc[1050];
stack<int>p;
int dp[1050], value[1050], dfn[1050], low[1050],belong[1050];
int deep, bcccnt,n,m;
void addedge(int a, int b)
{
g[a].push_back(b);
}
void tarjandfs(int num)
{
dfn[num] = low[num] = deep++;
for(unsigned int i = 0; i <g[num].size(); i++)
{
int to = g[num][i];
if (dfn[to] == 0)
{
p.push(to);
tarjandfs(to);
low[num] = min(low[num], low[to]);
}
else
if (belong[to] == -1)low[num] = min(low[num], dfn[to]);//要保证不是横向边
}
if (low[num] == dfn[num])
{
while (p.top() != num)
{
int temp = p.top();
belong[temp] = bcccnt;
bcc[bcccnt].push_back(temp);
value[bcccnt]++;
p.pop();
}
belong[p.top()] = bcccnt;
bcc[bcccnt].push_back(p.top());
value[bcccnt]++;
p.pop(); bcccnt++;
}
}
int dpdfs(int num)
{
if (dp[num])return dp[num];
dp[num] = value[num];
for (unsigned int i = 0; i < bcc[num].size(); i++)
{
int to = bcc[num][i];
for (unsigned int j = 0; j < g[to].size(); j++)
{
int temp = g[to][j];
if (belong[temp] == num)continue;
dp[num] = max(dp[num], value[num] + dpdfs(belong[temp]));
}
}
return dp[num];
}
int main()
{
int t;
scanf("%d", &t);
while (t--)
{
scanf("%d%d", &n, &m);
deep = 1; bcccnt = 0;
while (!p.empty())p.pop();
for (int i = 0; i <= n; i++)dp[i] = 0, value[i] = 0, dfn[i] = 0, low[i] = 0, belong[i] = -1,g[i].clear(),bcc[i].clear();
for (int i = 0; i < m; i++)
{
int a, b;
scanf("%d%d", &a, &b);
addedge(a, b);
}
for (int i = 1; i <= n; i++)
{
if (dfn[i])continue;
p.push(i);//这里记得push
tarjandfs(i);
}
for (int i = 0; i < bcccnt; i++)
{
if (dp[i])continue;
dpdfs(i);
}
int ans = 0;
for (int i = 0; i < bcccnt; i++)
{
ans = max(ans, dp[i]);
}
printf("%d\n", ans);
}
return 0;
}