// Source: https://usaco.guide/general/io
#include <bits/stdc++.h>
#include <algorithm>
using namespace std;
struct jack{
int a;
int b;
} v[300005];
bool cmp( jack x, jack y ) {
return x.a < y.a;
}
int main() {
int n, s, smax;
int x;
cin >> n;
for ( int i = 0; i < n - 1; i++ ) {
cin >> v[i].a >> v[i].b;
if ( v[i].a > v[i].b ) {
x = v[i].a;
v[i].a = v[i].b;
v[i].b = x;
}
}
sort(v, v + (n-1), cmp);
smax = s = 1;
for ( int i = 0; i < n-2; i++ ) {
if ( v[i].a == v[i + 1].a ) {
s++;
}
else {
if ( s > smax )
smax = s;
s = 1;
}
}
if ( s > smax )
smax = s;
cout << smax;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |