CCF---201909-2-- 小明种苹果（续）---C++

实现代码

#include<iostream>
#define SIZE 1000+5
using namespace std;

bool flag[SIZE];

int main() {
	int n, m, a, b, sum = 0, D = 0, E = 0;
	cin >> n;
	for (int i = 0; i < n; i++) {
		flag[i] = false;
		cin >> m;
		if (m) {
			cin >> a;
			for (int j = 1; j < m; j++) {
				cin >> b;
				if (b <= 0) a += b;
				else if (a != b) {
					a = b;
					flag[i] = true;
				}
			}
			if(flag[i]) D++;	//最后判断，因为一棵树最多记录一次
		}
		sum += a;
	}
	if (n > 2) {
		for (int i = 0; i < n; i++) if (flag[(i - 1 + n) % n] && flag[i % n] && flag[(i + 1) % n]) E++;
	}
	cout << sum << " " << D << " " << E << " " << endl;
	return 0;
}