Codeforces Round #384 (Div. 2), problem: (D) Chloe and pleasant prizes Solution in C/C++

By | 2017-04-07T22:11:47+00:00 December 17th, 2016|Categories: C/C++, Programming|Tags: , , , , , , , |

#include <stdio.h> #include <string.h> #define MAX(X,Y) ((X)>(Y) ? (X) : (Y)) #define INF 1000000000000000 typedef long long LL; int n,sz,first[200010],next[400010],tail[400010],son[200010],bro[200010],vis[200010]; LL a[200010],s[200010],maxs[200010],maxs2[200010]; void addedge(int u,int v); void dfs(int u); int main(void) { //freopen("prize.in","r",stdin); //freopen("prize.out","w",stdout); scanf("%d",&n); int i; for(i=1;i<=n;i++) scanf("%I64d",&a[i]); int u,v; memset(first,0,sizeof(first)); for(sz=0,i=1;i<=n-1;i++) { [...]