Submission #111221

---

Source Code Expand

#include <stdio.h>
#include <stdlib.h>

#include <iostream>

#include <algorithm>
#include <utility>
#include <cmath>
#include <string>
#include <vector>

using namespace std;

int n, m;
int t[50][50];
int r[50][50];


int dfs( int i, int g )
{
	if ( t[i][i]!=0 )
	{
		return 0;
	}
	//cout << i << "," << g << endl;
	int res =1;
	t[i][i] = g;
	for( int j=0; j<n; ++j )
	{
		if ( r[i][j] && !t[j][j] )
		{
			res += dfs( j, g );
		}
	}
	return res;
}

int main()
{
	cin >> n >> m;

	for( int i=0; i<50; ++i )
	{
		for( int j=0; j<50; ++j )
		{
			t[i][j] = 0;
			r[i][j] = 0;
		}
	}

	for( int i=0; i<m; ++i )
	{
		int x, y;
		cin >> x >> y;
		x--, y--;
		r[x][y] = 1;
		r[y][x] = 1;
	}

	int m=1;
	for( int i=0; i<n; ++i )
	{
		int tm = 0;
		tm = dfs( i, i+1 );
		if ( m < tm ) m = tm;
	}
	cout << m << endl;

	return 0;
}

Submission Info

Judge Result