rt，这个好似没有数组越界啥的吧，怎么就全部RE了……

#include <bits/stdc++.h>
using namespace std;
const int N = 110;
char name[N][25], sign[N][205];
int n, maxn = INT_MIN, num[N] = {0};

int main() {
    //freopen("save.in", "r", stdin);
    //    freopen("save.out", "w", stdout);
    ios::sync_with_stdio(false);
    cin >> n;
    for(int i = 1; i <= n; ++ i) {
        scanf("%s", name[i]);
        scanf("%s", sign[i]);
    }
    for(int i = 1; i <= n; ++ i) {
        for(int j = 0; j <= strlen(sign[i])-3; ++ j) {
            if(sign[i][j] == 's' && sign[i][j+1] == 'o' && sign[i][j+2] == 's')
                num[i] ++;
        }
        if(num[i] > maxn) maxn = num[i];
    }
    bool flag = true;
    for(int i = 1; i <= n; ++ i) {
        if(num[i] == maxn) {
            if(flag) {
                flag = false;
                printf("%s", name[i]);
            }
            else printf(" %s", name[i]);
        }
    }
    cout << endl << maxn << endl;
    return 0;
}