Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- #define int long long
- using namespace std;
- const int N = 1e4 + 7;
- vector<int> g[N];
- bool used[N];
- int dfs(int v){
- int res = g[v].size();
- for(int i = 0; i < g[v].size(); i++)
- if(!used[g[v][i]])
- {
- used[g[v][i]] = true;
- res += dfs(g[v][i]);
- }
- return res;
- }
- int32_t main()
- {
- ios_base::sync_with_stdio(0);
- int n, m, u, v;
- cin >> n >> m;
- for(int i = 0; i < m; i++)
- {
- cin >> u >> v;
- g[u-1].push_back(v-1);
- g[v-1].push_back(u-1);
- }
- int ans = 0;
- for(int i = 0; i < n; i++)
- {
- if(!used[i])
- {
- used[i] = 1;
- ans = max(ans, dfs(i)/2);
- }
- }
- cout << ans;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement