| |||
#include<stdio.h>
#include<string.h>
int n,m;
int flow[1210][1210];
int dist[1210];
int gap[1210];
int min(int a,int b)
{
if(a<b) return a;
else return b;
}
int find_path(int p, int limit = 0x3f3f3f3f)
{
if(p == n - 1) return limit;
for(int i = 0; i < n; ++i)
{
if(dist[p] == dist[i] + 1 && flow[p][i] > 0)
{
int t = find_path(i, min(limit, flow[p][i]));
if(t < 0) return t;
if(t > 0)
{
flow[p][i] -= t;
flow[i][p] += t;
return t;
}
}
}
int label = n;
for(int i = 0; i < n; ++i) if(flow[p][i] > 0) label = min(label, dist[i] + 1);
if(--gap[dist[p]] == 0 || dist[0] >= n) return -1;
++gap[dist[p] = label];
return 0;
}
int iSAP()
{
gap[0] = n;
int maxflow = 0;
int t = 0;
while((t = find_path(0)) >= 0)
maxflow += t;
return maxflow;
}
int main()
{
memset(flow,0,sizeof(flow));
memset(gap,0,sizeof(gap));
memset(dist,0,sizeof(dist));
scanf("%d%d", &n, &m);
for(int i=1;i<=n;i++)
{
int x;
scanf("%d",&x);
flow[0][i]=x;
}
int sum=0;
for(int i=1;i<=m;i++)
{
int x, y, c;
scanf("%d%d%d", &x, &y, &c);
flow[x][n+i]=1<<30-1;
flow[y][n+i]=1<<30-1;
flow[n+i][n+m+1]+=c;
sum+=c;
}
n=n+m+2;
printf("%d/n", sum-iSAP());
return 0;
}