CCF201909-1 201909-2

CCF201909-1小明种苹果

100

# include <stdio.h>
# include <math.h>

int n,m;
int T,k,P;

int main(void) {
	scanf("%d%d",&n,&m);

	int i,j;
	for(i=1; i<=n; i++) {
		int a;
		scanf("%d",&a);
		T+=a;

		int drop=0;
		for(j=0; j<m; j++) {
			scanf("%d",&a);
			T+=a;
			drop+=abs(a);
		}

		if(drop>P) {
			k=i;
			P=drop;
		}
	}

	printf("%d %d %d\n",T,k,P);
	return 0;

}

CCF201909-2小明种苹果（续）

100

# include <iostream>

using namespace std;

const int N=1010;

int n,m;
int T,D,E;
bool a[N];

int main(void) {
	cin>>n;

	int ina;
	for(int t=1; t<=n; t++) {
		int sum;
		cin>>m>>sum;
		for(int i=1; i<m; i++) {
			cin>>ina;

			if(ina<=0)sum+=ina;
			else if(ina<sum) {
				a[t]=true;
				sum=ina;
			}
		}

		T+=sum;
		if(a[t])D++;
	}

	a[0]=a[n],a[n+1]=a[1];//or取模

	for(int i=1; i<=n; i++)
		if(a[i] && a[i-1] && a[i+1])E++;

	cout<<T<<" "<<D<<" "<<E<<endl;
	return 0;
}