> void init()
> {
> 	int i;
> 
> 	scanf("%d%d", &N, &K);
> 	memset(net, 0, sizeof(net));
> 	num.clear();
> 	for (i = 0; i < N; i++)
> 	{
> 		scanf("%d%d%d", &itv[i].a, &itv[i].b, &itv[i].w);
> 		num.insert(itv[i].a);
> 		num.insert(itv[i].b);
> 	}
> 	int id = 1;
> 	for (set<int> ::iterator it = num.begin(); it != num.end(); ++it, ++id)
> 	{
> 		ID[*it] = id;
> 	}
> 	for (i = 0; i <= id; i++)
> 	{
> 		net[i][i+1].c = K;
> 		net[i][i+1].w = 0;
> 	}
> 	for (i = 0; i < N; i++)
> 	{
> 		net[ID[itv[i].a]][ID[itv[i].b]].c = 1;
> 		net[ID[itv[i].a]][ID[itv[i].b]].w = -itv[i].w;
> 		net[ID[itv[i].b]][ID[itv[i].a]].w = itv[i].w;
> 	}
> 	minc = 0;
> 	n = id + 2;
> 	s = 0;
> 	t = n - 1;
> }

我用你的构图法结果 猛RE...