题解 | #特征提取#

自存

//
// Created by DELL on 2021/10/16.
//
#include <bits/stdc++.h>
using namespace std;

int main(){
    int N,M;
    cin >> N;
    pair<int,int> f;
    int num;

    while (N--){
        cin >> M;
        map<pair<int,int>,int> frame;
        map<pair<int,int>,int> lastFrame;
        int max=0;
        while (M--){
            cin >> num;
            for (int i = 0; i < num; ++i) {
                cin >> f.first >> f.second;
            
            if(lastFrame.count(f)){
                frame[f] = lastFrame[f] + 1;
            }else{
                frame[f] = 1;
            }
            if(max<frame[f]){
                max = frame[f];
            }
                }
            lastFrame.clear();
            lastFrame.swap(frame);
        }
        cout << max << endl;
    }
    return 0;
}