CSP 201909-1 小明种苹果 100分解法

 

 

 

【思路】直接在输入时就顺便计算总的 苹果树数量与去除的苹果数量（记得取绝对值），记录苹果去除最大值的数量与编号

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<string>
#include <cstring>
using namespace std;
int b[10001][10001] = { 0 };
int k = 0;
int main()
{
	int n, m,sumt=0,sumk=0,sump=0;
	int totalk=0,num=0;
	cin >> n >> m;
	for (int i = 1; i <=n; i++)
	{
		sumk = 0;
		for (int j = 1; j <= m+1; j++)
		{
			cin >> b[i][j];
			if (j > 1)
			{
				sumk += b[i][j];//每个果树采摘的果子总数,总和
			}
		}
		sumk = abs(sumk);
		if (num < max(num, sumk)) {
			k = i;
			num = max(num, sumk);//得到蔬果最多树的编号和数量
		}
		totalk += sumk;//总的去除的果子数
		sumt += b[i][1];//总的果子数
	}
	sumt = sumt - totalk;
	cout << sumt << " " << k << " " << num;
	return 0;
}
//3 3
//73 -8 -6 -4
//76 -5 -10 -8
//80 -6 -15 0