Problem - 376B - Codeforces

最新推荐文章于 2019-03-01 14:57:00 发布

叶灯

最新推荐文章于 2019-03-01 14:57:00 发布

阅读量410

点赞数 1

分类专栏： codeforces 文章标签： codeforces

本文链接：https://blog.csdn.net/yedengmei/article/details/50365902

版权

codeforces 专栏收录该内容

3 篇文章 0 订阅

订阅专栏

点击打开链接

B. I.O.U.

Imagine that there is a group of three friends: A, B and С. A owes B 20 rubles and B owes C 20 rubles. The total sum of the debts is 40 rubles. You can see that the debts are not organized in a very optimal manner. Let's rearrange them like that: assume that A owes C 20 rubles and B doesn't owe anything to anybody. The debts still mean the same but the total sum of the debts now equals 20 rubles.

This task is a generalisation of a described example. Imagine that your group of friends hasn people and you know the debts between the people. Optimize the given debts without changing their meaning. In other words, finally for each friend the difference between the total money he should give and the total money he should take must be the same. Print the minimum sum of all debts in the optimal rearrangement of the debts. See the notes to the test samples to better understand the problem.

Input

The first line contains two integers n andm (1 ≤ n ≤ 100; 0 ≤ m ≤ 10⁴). The nextm lines contain the debts. The i-th line contains three integers a_i, b_i, c_i(1 ≤ a_i, b_i ≤ n; a_i ≠ b_i; 1 ≤ c_i ≤ 100), which mean that person a_i owes personb_ic_i rubles.

Assume that the people are numbered by integers from 1 to n.

It is guaranteed that the same pair of people occurs at most once in the input. The input doesn't simultaneously contain pair of people(x, y) and pair of people (y, x).

Output

Print a single integer — the minimum sum of debts in the optimal rearrangement.

Sample test(s)

Input

Output

Input

3 0

Output

Input

Output

该题的意思就是求一共欠多少债务，此题难点在于一个人不止欠别人欠，还可能别人欠他的钱。

我开始时想成啦求最大的欠债量，前三个样列也对，但是错在啦第四个样列，后来仔细想拉想，应该是所有人欠债的总和

我想到的是开两个数组，a[i]表示第i 个人所欠的钱，b[i]表示的是第i个人获得的钱。一个人所欠的钱减去获得的钱就是他的

债务啦！

#include<iostream>
#include<cstdio>

int main()
{
    int  n,m;
    while(scanf("%d %d",&n,&m) != EOF)
    {
       int a[105] = {0},b[105] = {0};
        int i,j,maxn = 0;
        int k,p,q;
        if(m == 0)
            printf("%d\n",maxn);
        else
        {
            for(i = 1;i <= m;i++)
            {
                scanf("%d%d%d",&k,&p,&q);
                a[k] += q;
                b[p] += q;
            }
        for(i = 1;i <= n;i++)
        {
            if(b[i] >= a[i])          //如果他所获得的钱大于欠的钱，则他的债务a[i]为0；
            {
                b[i] = b[i] - a[i];
                a[i] = 0;
            }
            else
                a[i] = a[i] - b[i];
        }
        for(i = 1;i <= n;i++)
        {
            maxn += a[i];
        }
        printf("%d\n",maxn);
        }
    }
    return 0;
}

下面附上大神的代码：

我看见他的代码有点惊讶，大神的思维就是好，这样的办法都想的出来。一个人所欠的所有债务减去他所获得的钱就是他最终所欠的债

#include<iostream>
using namespace std;
int a[101],n,m,x,y,j,sum;
int main(){
	cin>>n>>m;
	for(int i=0;i<m;i++){
		cin>>x>>y>>j;
		a[x]-=j;
		a[y]+=j;
	}
	for(int i=1;i<=n;i++)if(a[i]>0)sum+=a[i];
	cout<<sum;
}