codeforces 1101D 点分治模板（注释掉的地方是需要自己填充的）

题意：一颗树，每个点有权值，问最长路径使得路径上的点的gcd > 1

 点分治写法的注意事项：一条分治完全处理完之后才可以更新，不能出栈的时候更新。

技巧：使用mark数组

#include <cstdio>
#include<vector>
#include<cstring>
#include<algorithm>
#include<iostream>
using namespace std;
const int maxn = 200000 + 5;
const int maxm = 400000 + 5;
int he[maxn],ne[maxm],ver[maxm],tot;
void add( int x,int y ){
    ver[++tot] = y;
    ne[tot] = he[x];
    he[x] = tot;
}
int root,  // 当前树的重心
        vis[maxn], // 标记点是否作为重心出现过
        n,        // 树的总点数
        sz[maxn],
        g[maxn];
void get_sz( int x,int f ){
    sz[x] = 1;
    g[x] = 0;
    for( int cure = he[x];cure;cure = ne[cure] ){
        int y  = ver[cure];
        if( y == f || vis[y] ) continue;
        get_sz( y,x );
        g[x] = max( g[x],sz[y] );
        sz[x] += sz[y];
    }
}
int find_root( int x,int f ){

    int minx = n;
    int re = x;
    for( int cure = he[x];cure;cure = ne[cure] ){
        int y  = ver[cure];
        if( vis[y] || y == f ) continue;
        int tmp = find_root( y,x );
        if( g[tmp] < minx ){
            re = tmp,minx = g[tmp];
        }
    }
    g[x] = max( g[x],sz[root]-sz[x] );
    if( g[x] < minx ) re = x;
    return re;
}
void get_root( int& x ){
    get_sz( x,0 );
    root = x;
    x = find_root( x,0 );
    root = x;
}
int gcd( int x,int y ){
    if( !y ) return x;
    return gcd( y,x%y );
}
int v[maxn],ans = 0,dis[maxn],mark[maxn];
vector<int> ve[maxn];
vector<pair<int,int> >ve2;
void dfs_dis( int x,int g,int f,int d ){
    int cur = v[x];
    cur = gcd( cur,g );
    if( cur == 1 ) return;
    ans = max( ans,d+1 );
    for( int i = 0;i < ve[ cur ].size();i++ ){
        int x = ve[cur][i];
        if( mark[x]==root )
            ans = max( ans,d+dis[ x ]+1 );
    }
    for( int cure = he[x];cure;cure = ne[cure] ){
        int y =  ver[cure];
        if( vis[y] || y == f ) continue;
        if( cur != 1 ) dfs_dis( y,cur,x,d+1 );
    }
    for( int i = 0;i < ve[cur].size();i++ ){
        int x = ve[cur][i];ve2.push_back( make_pair(x,d) );
    }
}
void dfs_div( int x ){
    if(vis[x]) return;
    get_root(x);
    vis[x] = 1;
    for( int cure = he[x];cure;cure = ne[cure] ){
        int y = ver[cure];
        if( vis[y] ) continue;
        dfs_dis( y,v[x],x,1 );
        /*for( int i = 0;i < ve2.size();i++ ){
            int x = ve2[i].first;
            if( mark[x] == root )
                dis[x] = max( dis[x],ve2[i].second );
            else dis[x] = ve2[i].second;
            mark[x] = root;
        }
        ve2.clear();*/
    }
    for( int cure = he[x];cure;cure = ne[cure] ){
        int y = ver[cure];
        if( vis[y] ) continue;
        dfs_div( y );
    }
}
void init(int n){
    memset( he,0,sizeof(int)*(n+1) );
    memset( vis,0,sizeof(int)*(n+1) );
    tot = 1;
}
int main(){
    //freopen( "C:\\Users\\qqq\\Desktop\\987.txt","r",stdin );
    int x,y;
    scanf("%d",&n);
    for( int i = 1;i <= 200000;i++ ){
        int c = i;
        for( int j = 2;j*j<= c;j++ ){
            if( c % j == 0 ){
                ve[i].push_back( j );
                while( c % j ==0 ) c/=j;
            }
        }
        if(c!=1)ve[i].push_back(c);
    }
    init(n);
    for( int i = 1;i <= n;i++ ) {
        scanf("%d",&v[i]);
        if( v[i] != 1 ) ans = 1;
    }
    for( int i = 1;i < n;i++ ){
        scanf("%d%d",&x,&y);
        add(x,y);add(y,x);
    }
    dfs_div(1);
    printf("%d",ans);
    puts("");
    return 0;
}