Codeforces Round #384 (Div. 2), problem: (D) Chloe and pleasant prizes Solution in C/C++
#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,next,tail,son,bro,vis; LL a,s,maxs,maxs2; 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); …