传送门:【BZOJ】1036 [ZJOI2008]树的统计Count
题目分析:bzoj貌似是跑一组如果错了就不测了的样子。。结果我的代码可能一开始就错了Orz。。就因为求max的时候res设为0了。。。可是明显有负数的啊!!!逗比了我。。还在别的地方查了那么久。。。
很明显的树链剖分,剖来剖去然后就可以轻松用线段树解决了,复杂度O(nlog^2n)。
感觉点重编号比边重编号更好理解的说。
代码如下:
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std ;
typedef long long LL ;
#define travel( e , H , u ) for ( Edge* e = H[u] ; e ; e = e -> next )
#define rep( i , a , b ) for ( int i = ( a ) ; i < ( b ) ; ++ i )
#define rev( i , a , b ) for ( int i = ( a ) ; i >= ( b ) ; -- i )
#define FOR( i , a , b ) for ( int i = ( a ) ; i <= ( b ) ; ++ i )
#define clr( a , x ) memset ( a , x , sizeof a )
#define cpy( a , x ) memcpy ( a , x , sizeof a )
#define ls ( o << 1 )
#define rs ( o << 1 | 1 )
#define lson ls , l , m
#define rson rs , m + 1 , r
#define root 1 , 1 , n
#define mid ( ( l + r ) >> 1 )
const int MAXN = 30005 ;
const int MAXE = 60005 ;
const int INF = 0x3f3f3f3f ;
struct Edge {
int v ;
Edge* next ;
} E[MAXE] , *H[MAXN] , *edge ;
int maxv[MAXN << 2] ;
int sum[MAXN << 2] ;
int size[MAXN] ;
int pos[MAXN] ;
int dep[MAXN] ;
int pre[MAXN] ;
int top[MAXN] ;
int val[MAXN] ;
int son[MAXN] ;
int tree_idx ;
int n , q ;
void clear () {
edge = E ;
dep[1] = 0 ;
size[0] = 0 ;
tree_idx = 0 ;
clr ( H , 0 ) ;
}
void addedge ( int u , int v ) {
edge -> v = v ;
edge -> next = H[u] ;
H[u] = edge ++ ;
}
void dfs ( int u ) {
size[u] = 1 ;
son[u] = 0 ;
travel ( e , H , u ) {
int v = e -> v ;
if ( v == pre[u] ) continue ;
dep[v] = dep[u] + 1 ;
pre[v] = u ;
dfs ( v ) ;
size[u] += size[v] ;
if ( size[v] > size[son[u]] ) son[u] = v ;
}
}
void rewrite ( int u , int top_element ) {
pos[u] = ++ tree_idx ;
top[u] = top_element ;
if ( son[u] ) rewrite ( son[u] , top_element ) ;
travel ( e , H , u ) {
if ( e -> v != son[u] && e -> v != pre[u] ) {
rewrite ( e -> v , e -> v ) ;
}
}
}
void pushup ( int o ) {
sum[o] = sum[ls] + sum[rs] ;
maxv[o] = max ( maxv[ls] , maxv[rs] ) ;
}
void build ( int o , int l , int r ) {
if ( l == r ) {
maxv[o] = sum[o] = val[l] ;
return ;
}
int m = mid ;
build ( lson ) ;
build ( rson ) ;
pushup ( o ) ;
}
void update ( int pos , int v , int o , int l , int r ) {
if ( l == r ) {
sum[o] = maxv[o] = v ;
return ;
}
int m = mid ;
if ( pos <= m ) update ( pos , v , lson ) ;
else update ( pos , v , rson ) ;
pushup ( o ) ;
}
int get_sum ( int L , int R , int o , int l , int r ) {
if ( L <= l && r <= R ) return sum[o] ;
int m = mid ;
if ( R <= m ) return get_sum ( L , R , lson ) ;
if ( m < L ) return get_sum ( L , R , rson ) ;
return get_sum ( L , R , lson ) + get_sum ( L , R , rson ) ;
}
int get_max ( int L , int R , int o , int l , int r ) {
if ( L <= l && r <= R ) return maxv[o] ;
int m = mid ;
if ( R <= m ) return get_max ( L , R , lson ) ;
if ( m < L ) return get_max ( L , R , rson ) ;
return max ( get_max ( L , R , lson ) , get_max ( L , R , rson ) ) ;
}
int query_sum ( int x , int y , int res = 0 ) {
while ( top[x] != top[y] ) {
int a = top[x] , b = top[y] ;
if ( dep[a] > dep[b] ) {
res += get_sum ( pos[a] , pos[x] , root ) ;
x = pre[a] ;
} else {
res += get_sum ( pos[b] , pos[y] , root ) ;
y = pre[b] ;
}
}
if ( dep[x] < dep[y] ) return res + get_sum ( pos[x] , pos[y] , root ) ;
else return res + get_sum ( pos[y] , pos[x] , root ) ;
}
int query_max ( int x , int y , int res = -INF ) {
while ( top[x] != top[y] ) {
int a = top[x] , b = top[y] ;
if ( dep[a] > dep[b] ) {
res = max ( res , get_max ( pos[a] , pos[x] , root ) ) ;
x = pre[a] ;
} else {
res = max ( res , get_max ( pos[b] , pos[y] , root ) ) ;
y = pre[b] ;
}
}
if ( dep[x] < dep[y] ) return max ( res , get_max ( pos[x] , pos[y] , root ) ) ;
else return max ( res , get_max ( pos[y] , pos[x] , root ) ) ;
}
void solve () {
char s[10] ;
int x , y , c ;
clear () ;
rep ( i , 1 , n ) {
scanf ( "%d%d" , &x , &y ) ;
addedge ( x , y ) ;
addedge ( y , x ) ;
}
dfs ( 1 ) ;
rewrite ( 1 , 1 ) ;
FOR ( i , 1 , n ) {
scanf ( "%d" , &c ) ;
val[pos[i]] = c ;
}
build ( root ) ;
scanf ( "%d" , &q ) ;
while ( q -- ) {
scanf ( "%s%d%d" , s , &x , &y ) ;
if ( s[1] == 'H' ) update ( pos[x] , y , root ) ;
else if ( s[1] == 'S' ) printf ( "%d\n" , query_sum ( x , y ) ) ;
else printf ( "%d\n" , query_max ( x , y ) ) ;
}
}
int main () {
scanf ( "%d" , &n ) ;
solve () ;
return 0 ;
}