CCF认证 2019-9 小明种苹果(续)

最新推荐文章于 2022-03-12 00:14:34 发布

Hcodeboy

最新推荐文章于 2022-03-12 00:14:34 发布

阅读量758

点赞数

分类专栏： CCF历年认证题文章标签： csp

本文链接：https://blog.csdn.net/shadiao_boy/article/details/121358216

版权

CCF历年认证题专栏收录该内容

16 篇文章 1 订阅

订阅专栏

#include<iostream>
using namespace std;

int n;

int m, a;

int first;

int d = 0, e = 0;

int sum = 0, t = 0;

int count[1010] = {0};

int main() {
	scanf("%d",&n);
	
	for(int i = 0; i < n; ++i) {
		scanf("%d",&m);
		
		for(int j = 0; j < m; ++j){
			scanf("%d",&a);
			
			if(a <= 0) {
				t += a;
			}
			else if(a > 0) {
				
				if(t > a) {
					count[i] = 1;
				}
				
				t = a;
			}
		}
		
		sum += t;
		if(count[i] == 1) d++;
		
	}
	

	
	for(int i = 1; i < n - 1; ++i) {
		if(count[i-1] == 1 && count[i] == 1 && count[i+1] == 1) e++;
	}
	
	if(count[n-2] == 1 && count[n-1] == 1 && count[0] == 1) e++;
	if(count[n-1] == 1 && count[0] == 1 && count[1] == 1) e++;
	
	printf("%d %d %d",sum,d,e);   
	
	return 0;
}

/*
4
4 74 -7 -12 -5
5 73 -8 -6 59 -4
5 76 -5 -10 60 -2
5 80 -6 -15 59 0
*/