0_0_30469401_16364\Main.java:1: 错误: 非法字符: '#'
#include <iostream>
^
0_0_30469401_16364\Main.java:1: 错误: 需要class, interface或enum
#include <iostream>
^
0_0_30469401_16364\Main.java:2: 错误: 非法字符: '#'
#include <cstdio>
^
0_0_30469401_16364\Main.java:3: 错误: 非法字符: '#'
#include <cstring>
^
0_0_30469401_16364\Main.java:4: 错误: 非法字符: '#'
#include <algorithm>
^
0_0_30469401_16364\Main.java:5: 错误: 非法字符: '#'
#define debug() puts("here")
^
0_0_30469401_16364\Main.java:8: 错误: 需要class, interface或enum
const int N = 510, INF = 0x3f3f3f3f;
^
0_0_30469401_16364\Main.java:9: 错误: 需要class, interface或enum
int mpa[N][N], dis[N], v[N];//v数组是马甲数组，dis数组用来表示该点与A集合中所有点之间的边的长度之和
^
0_0_30469401_16364\Main.java:10: 错误: 需要class, interface或enum
bool vis[N];//用来标记是否该点加入了A集合
^
0_0_30469401_16364\Main.java:11: 错误: 需要class, interface或enum
int stoer_wagner(int n)
^
0_0_30469401_16364\Main.java:14: 错误: 需要class, interface或enum
for(int i = 1; i <= n; i++) v[i] = i;//初始马甲为自己
^
0_0_30469401_16364\Main.java:14: 错误: 需要class, interface或enum
for(int i = 1; i <= n; i++) v[i] = i;//初始马甲为自己
^
0_0_30469401_16364\Main.java:14: 错误: 需要class, interface或enum
for(int i = 1; i <= n; i++) v[i] = i;//初始马甲为自己
^
0_0_30469401_16364\Main.java:15: 错误: 需要class, interface或enum
while(n > 1)
^
0_0_30469401_16364\Main.java:18: 错误: 需要class, interface或enum
memset(vis, 0, sizeof vis);
^
0_0_30469401_16364\Main.java:19: 错误: 需要class, interface或enum
memset(dis, 0, sizeof dis);
^
0_0_30469401_16364\Main.java:20: 错误: 需要class, interface或enum
vis[v[pre]] = true; ////
^
0_0_30469401_16364\Main.java:21: 错误: 需要class, interface或enum
for(int i = 1; i < n; i++)
^
0_0_30469401_16364\Main.java:21: 错误: 需要class, interface或enum
for(int i = 1; i < n; i++)
^
0_0_30469401_16364\Main.java:21: 错误: 需要class, interface或enum
for(int i = 1; i < n; i++)
^
0_0_30469401_16364\Main.java:24: 错误: 需要class, interface或enum
for(int j = 2; j <= n; j++)//根据之前加入的点，要更新dis数组，并找到最大的dis
^
0_0_30469401_16364\Main.java:24: 错误: 需要class, interface或enum
for(int j = 2; j <= n; j++)//根据之前加入的点，要更新dis数组，并找到最大的dis
^
0_0_30469401_16364\Main.java:24: 错误: 需要class, interface或enum
for(int j = 2; j <= n; j++)//根据之前加入的点，要更新dis数组，并找到最大的dis
^
0_0_30469401_16364\Main.java:28: 错误: 需要class, interface或enum
if(k == -1 || dis[v[k]] < dis[v[j]]) k = j;
^
0_0_30469401_16364\Main.java:29: 错误: 需要class, interface或enum
}
^
0_0_30469401_16364\Main.java:31: 错误: 需要class, interface或enum
if(i == n - 1)//最后一次加入的点就要更新答案了
^
0_0_30469401_16364\Main.java:34: 错误: 需要class, interface或enum
for(int j = 1; j <= n; j++)//将该点合并到pre上，相应的边权就要合并
^
0_0_30469401_16364\Main.java:34: 错误: 需要class, interface或enum
for(int j = 1; j <= n; j++)//将该点合并到pre上，相应的边权就要合并
^
0_0_30469401_16364\Main.java:34: 错误: 需要class, interface或enum
for(int j = 1; j <= n; j++)//将该点合并到pre上，相应的边权就要合并
^
0_0_30469401_16364\Main.java:37: 错误: 需要class, interface或enum
mpa[v[j]][v[pre]] += mpa[v[j]][v[k]];
^
0_0_30469401_16364\Main.java:38: 错误: 需要class, interface或enum
}
^
0_0_30469401_16364\Main.java:40: 错误: 需要class, interface或enum
}
^
0_0_30469401_16364\Main.java:42: 错误: 需要class, interface或enum
}
^
0_0_30469401_16364\Main.java:45: 错误: 需要class, interface或enum
}
^
0_0_30469401_16364\Main.java:49: 错误: 需要class, interface或enum
cin>>t;
^
0_0_30469401_16364\Main.java:50: 错误: 需要class, interface或enum
while(t--){
^
0_0_30469401_16364\Main.java:52: 错误: 需要class, interface或enum
memset(mpa, 0, sizeof mpa);
^
0_0_30469401_16364\Main.java:53: 错误: 需要class, interface或enum
for(int i = 0; i < m; i++)
^
0_0_30469401_16364\Main.java:53: 错误: 需要class, interface或enum
for(int i = 0; i < m; i++)
^
0_0_30469401_16364\Main.java:53: 错误: 需要class, interface或enum
for(int i = 0; i < m; i++)
^
0_0_30469401_16364\Main.java:56: 错误: 需要class, interface或enum
mpa[a][b] += 1, mpa[b][a] += 1;
^
0_0_30469401_16364\Main.java:57: 错误: 需要class, interface或enum
}
^
0_0_30469401_16364\Main.java:59: 错误: 需要class, interface或enum
else cout<<"No\n";
^
0_0_30469401_16364\Main.java:60: 错误: 需要class, interface或enum
}
^
0_0_30469401_16364\Main.java:62: 错误: 需要class, interface或enum
}
^
45 个错误
|
