ACM-ICPC 2018 徐州赛区网络预赛-----Features Track（思维+STL）

最新推荐文章于 2022-01-10 09:18:44 发布

对你说的对

最新推荐文章于 2022-01-10 09:18:44 发布

阅读量194

点赞数

分类专栏： STL 思维or贪心

本文链接：https://blog.csdn.net/jinghui_7/article/details/82560757

版权

思维or贪心同时被 2 个专栏收录

34 篇文章 0 订阅

订阅专栏

STL

20 篇文章 0 订阅

订阅专栏

题目链接

Morgana is learning computer vision, and he likes cats, too. One day he wants to find the cat movement from a cat video. To do this, he extracts cat features in each frame. A cat feature is a two-dimension vector <xx, yy>. If x_ixi= x_jxj and y_iyi = y_jyj, then <x_ixi, y_iyi> <x_jxj, y_jyj> are same features.

So if cat features are moving, we can think the cat is moving. If feature <aa, bb> is appeared in continuous frames, it will form features movement. For example, feature <aa , bb > is appeared in frame 2,3,4,7,82,3,4,7,8, then it forms two features movement 2-3-42−3−4 and 7-87−8 .

Now given the features in each frames, the number of features may be different, Morgana wants to find the longest features movement.

Input

First line contains one integer T(1 \le T \le 10)T(1≤T≤10) , giving the test cases.

Then the first line of each cases contains one integer nn (number of frames),

In The next nn lines, each line contains one integer k_iki ( the number of features) and 2k_i2ki intergers describe k_ikifeatures in ith frame.(The first two integers describe the first feature, the 33rd and 44th integer describe the second feature, and so on).

In each test case the sum number of features NN will satisfy N \le 100000N≤100000 .

Output

For each cases, output one line with one integers represents the longest length of features movement.

样例输入

样例输出

#include<bits/stdc++.h>
using namespace std;

int n,k,x,y;

struct Node
{
    int x,y;
    bool operator<(const Node& aa) const
    {
        if(x==aa.x) return y<aa.y;
        return x<aa.x;
    }
    bool operator==(const Node& aa) const
    {
        if(x==aa.x&&y==aa.y)
            return true;
        return false;
    }
}node;

map<Node,int>mp[100010];

int main()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d",&n);
        int i,j,Max=-1;
        int cnt=0;
        for(i=1;i<=n;i++)
        {
            mp[i].clear();
            scanf("%d",&k);
            for(j=1;j<=k;j++)
            {
                scanf("%d%d",&node.x,&node.y);
                mp[i][node] = mp[i-1][node]+1;
                if(Max<mp[i][node])
                    Max=mp[i][node];
            }
        }
        printf("%d\n",Max);
    }
    return 0;
}