Start: Jul, 03, 2019 08:38:00
2019年度暑期短学期第七天 助教场
End: Jul, 04, 2019 23:00:00
Time elapsed:
Time remaining:

Problem_ID: B
Result: Accepted
Time: 475ms
Memory: 1760kB
Author: 2018212212064
In contest: 1292

#include <cstdio>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <queue>
#include <map>
#include <set>
#include <stack>
#include <vector>
#include <string>
#include <iostream>
#include <list>
#include <cstdlib>
#include <bitset>
#define lowbit(x) (x&(-x))
#define lson root<<1,l,mid
#define rson root<<1|1,mid+1,r
const long long INF = 0x3f3f3f3f3f3f3f3fLL;
const int inf = 0x3f3f3f3f;
using namespace std;
string ans;
int main()
{
	int T;
	int n, m;
	scanf("%d", &T);
	while (T--)
	{
		scanf("%d", &n);
		map<string, int> mp;
		for (int i = 1; i <= n; ++i)
		{
			cin >> ans;
			mp[ans]++;
		}
		int ans = 0;
		for (auto it = mp.begin(); it != mp.end(); ++it)
			ans = max(ans, it->second);
		cout << ans << endl;
	}
}