3382：【例66.2】 朋友关系(编程启蒙）

#include<bits/stdc++.h>
using namespace std;
string ss,ss1,s[100000];
int n,m,k=0,a[1005][1005],b1,b2,maxn;
int f(string x) {
    for (int i = 1; i <= k; i++) {
        if (s[i] == x)return i;
    }
    k++;
    s[k] = x;
    return k;
}
int main() {
    cin >> n >> m;
    for (int i = 1; i <= m; i++) {
        cin >> ss >> ss1;
        b1 = f(ss);
        b2 = f(ss1);
        a[b1][b2] = 1;
        a[b2][b1] = 1;
    }
    for (int i = 1; i <= n; i++) {
        int sum = 0;
        for (int j = 1; j <= n; j++) {
            if (a[i][j] == 1)sum++;
        }
        if (sum > maxn)maxn = sum;
    }
    cout << maxn;
}