BZOJ2563:阿狸与桃子的策略博弈游戏分析

 1 #include 
 2 #include 
 3 
 4 const int N(10005);
 5 double val[N],ans;
 6 int n,m;
 7 
 8 int Presist()
 9 {
10     scanf("%d%d",&n,&m);
11     for(int i=1; i<=n; ++i)
12         scanf("%lf",val+i);
13     for(int u,v; m--; )
14     {
15         scanf("%d%d%lf",&u,&v,&val[0]);
16         val[u]+=val[0]/2.0,val[v]+=val[0]/2.0;
17     }
18     std::sort(val+1,val+n+1);
19     for(; n; ) ans+=val[n--],ans-=val[n--];
20     printf("%.0lf",ans);
21     return 0;
22 }
23 
24 int Aptal=Presist();
25 int main(int argc,char**argv){;}