ACM-ICPC 2018 徐州赛区网络预赛 F. Features Track

题目链接
#题解
题目大意 给你n个时间段 每个时间段内有若干特征 问你相同特征最大连续时间是多长(ai == aj && bi == bj)

直接模拟一下即可 题意难懂是真的
#AC代码

#include <stdio.h>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const int INF = 0x3f3f3f3f;
const int MAXN = 1e5 + 10;
vector<ll> vec[MAXN];

int main()
{
#ifdef LOCAL
	freopen("C:/input.txt", "r", stdin);
#endif
	int T;
	cin >> T;
	while (T--)
	{
		int n;
		cin >> n;
		for (int i = 1; i <= n; i++)
		{
			vec[i].clear();
			int k;
			scanf("%d", &k);
			for (int j = 0; j < k; j++)
			{
				int a, b;
				scanf("%d%d", &a, &b);
				vec[i].push_back((long long)1e9 * a + b);
			}
			sort(vec[i].begin(), vec[i].end());
		}
		map<ll, int> mp;
		int ans = 1;
		for (int j = 0; j < vec[1].size(); j++)
			mp[vec[1][j]]++;
		for (int i = 2; i <= n; i++)
		{
			for (auto &it : mp)
			{
				auto lb = lower_bound(vec[i].begin(), vec[i].end(), it.first);
				if (lb != vec[i].end() && *lb == it.first)
					it.second++;
				else
					it.second = 0;
				ans = max(ans, it.second);
			}
		}
		cout << ans << endl;
	}

	return 0;
}