//Accepted 7324 KB 203 ms /* source:fzu2028 time :2015.5.29 by :songt */ /*题解: 树链剖分 单点更新,求路径和 */ #include <cstdio> #include <cstring> ; int max(int a,int b) { return a>b?a:b; } void swap(int &a,int &b) { int t=a; a=b; b=t; } struct…