poj 3107

关注

原创最新推荐文章于 2026-02-24 00:12:52 发布 402 阅读 AI 写同款· GEO 优化 ›

长期换衣行人重识别（Long-Term Clothes-Changing Person Reid）数据集汇总长期换衣行人重识别任务中目前常用的数据集总览目前换衣数据集的主要问题数据集换衣/总体情况集统计DeepChange（2021）LaST（2021）COCAS(2020)VC-Clothes(2020)LTCC(2020)PRCC(2019)Celebrities-reID（2019）总览在长期换衣行人重识别的任务当中，数据集的获取（尤其是对于学术环境下）是一个难点，主要的困难有以下几点：采集大规模的数据集比较困难。采集不同的衣服的数据集比较困难。采集不同衣服不同角度的数据集比较困难。目前也有阅读详情

很水的题.. 跑了516ms 好慢..

#include <iostream>
#include <stdio.h>
#include <vector>
#include <cstring>

using namespace std;

const int MAXN = 50005;
int node [MAXN];
int ans[MAXN];
int head[MAXN];
int sum, n;
int edge[MAXN*2];
int next[MAXN*2];
int vis[MAXN];

void addedge ( int a , int b )
{
    int temp = head[a];
    head[a] = sum;
    edge[sum] = b;
    next[sum] = temp;
    sum ++;

    temp = head[b];
    head[b] = sum;
    edge[sum] = a;
    next[sum] = temp;
    sum ++;
}

int dfs ( int u )
{
    int num = 1;
    vis[u] = 1;
    for ( int i = head[u] ; i != -1; i = next[i] )
    {
        int v = edge[i];
        //cout << "***** " << v << endl;
        if ( !vis[v] )
        {
            num += dfs( v );
        }
    }
    return node[u] = num;
}

void find_ans ( int u )
{
    ans[u] = n - node[u];
    vis[u] = 1;
    for ( int i = head[u] ; i != -1 ; i = next[i] )
    {
        int v = edge[i];
        if ( !vis[v] )
        {
            ans[u] = max ( node[v] , ans[u] );
            find_ans ( v );
        }
    }
}

int main()
{
    while ( scanf("%d" , &n ) != EOF )
    {
        sum =0;
        memset ( ans , 0 , (n+1)*sizeof ( int ));
        memset ( node , 0 , (n+1)*sizeof ( int ));
        memset ( vis , 0 , (n+1)*sizeof ( int ));
        memset ( head , -1 , (n+1)*sizeof ( int ));
        for ( int i = 0 ; i < n-1; i ++ )
        {
            int a , b;
            scanf("%d%d", &a , &b );
            addedge( a , b );
        }
        //cout << "here" << endl;
        dfs ( 1 );
        //cout << "here" << endl;
        memset ( vis , 0 , (n+1)*sizeof ( int ));
        find_ans ( 1 );
        //cout << "here" << endl;
        int w = 99999999;
        for ( int i = 1 ; i <= n ; i ++ )
        {
            if ( w > ans[i] )
                w = ans[i];
        }
        int flag = 1;
        for ( int i = 1; i <= n ; i ++ )
            if ( w == ans[i] && flag )
                printf("%d", i ),flag = 0;
            else if ( w == ans[i] )
                printf(" %d" , i );
        printf("\n");
    }
    return 0;
}