AcWing 1944. 记录保存(pair数组)
原题链接
简单
作者:
NobleFire
,
2022-04-28 10:47:35
,
所有人可见
,
阅读 178
算法1
C++ 代码
#include <iostream>
#include <algorithm>
#include <map>
using namespace std;
const int N = 1010;
pair<string, int> p[N];
int main(){
int n;
cin >> n;
for (int i = 0; i < n; i ++ ){
string str[3];
cin >> str[0] >> str[1] >> str[2];
sort(str, str + 3);
string s = str[0] + " " + str[1] + " " + str[2];
bool flag = false;
for (int j = 0; j < i; j ++ )
if(p[j].first == s) {
p[j].second++;
flag = true;
}
if(!flag) { p[i].first = s; p[i].second++; }
}
int res = 0;
for (int i = 0; i < n; i ++ )
res = max(res, p[i].second);
cout << res << endl;
return 0;
}