记录编号	141567	评测结果	AAAAAAAAAAAAAAAAAAAA
题目名称	[国家集训队2011]复杂的大门	最终得分	100
用户昵称	cstdio	是否通过	通过
代码语言	C++	运行时间	0.119 s
提交时间	2014-12-03 08:53:12	内存使用	0.71 MiB

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<vector>
#include<queue>
using namespace std;
const int SIZEN=20010,INF=0x7fffffff/2;
class EDGE{
public:
	int from,to,cap,flow;
};
vector<EDGE> edges;
vector<int> c[SIZEN];
int S,T,N;
int sum;//所有f之和
int depth[SIZEN]={0};
int cur[SIZEN]={0};
void addedge(int from,int to,int cap){
	edges.push_back((EDGE){from,to,cap,0});
	edges.push_back((EDGE){to,from,0,0});
	int tot=edges.size()-2;
	c[from].push_back(tot);
	c[to].push_back(tot+1);
}
queue<int> Q;
bool vis[SIZEN]={0};
bool BFS(void){
	memset(vis,0,sizeof(vis));
	while(!Q.empty()) Q.pop();
	Q.push(S);vis[S]=true;depth[S]=0;
	while(!Q.empty()){
		int x=Q.front();Q.pop();
		for(int i=0;i<c[x].size();i++){
			EDGE &e=edges[c[x][i]];
			if(!vis[e.to]&&e.cap>e.flow){
				vis[e.to]=true;
				depth[e.to]=depth[x]+1;
				Q.push(e.to);
			}
		}
	}
	return vis[T];
}
int DFS(int x,int a){
	if(x==T||!a) return a;
	int ans=0;
	for(int &i=cur[x];i<c[x].size();i++){
		EDGE &e=edges[c[x][i]];
		if(depth[x]+1==depth[e.to]){
			int cf=DFS(e.to,min(a,e.cap-e.flow));
			if(cf){
				ans+=cf;a-=cf;
				e.flow+=cf;edges[c[x][i]^1].flow-=cf;
			}
			if(!a) break;
		}
	}
	if(!ans) depth[x]=-1;
	return ans;
}
int Dinic(void){
	int ans=0;
	while(BFS()){
		memset(cur,0,sizeof(cur));
		ans+=DFS(S,INF);
	}
	return ans;
}
void init(void){
	int n,m;
	scanf("%d%d",&n,&m);
	N=2*n+1,S=0,T=N;
	int tim;
	for(int i=1;i<=n;i++){
		scanf("%d",&tim);
		sum+=tim;
		addedge(S,i,tim);
		addedge(i+n,T,tim);
	}
	int u,v,w;
	for(int i=1;i<=m;i++){
		scanf("%d%d%d",&u,&v,&w);
		addedge(u,v+n,w);
	}
}
int main(){
	freopen("gate.in","r",stdin);
	freopen("gate.out","w",stdout);
	init();
	printf("%d\n",sum-Dinic());
	return 0;
}