201909-2小明种苹果（续）

#include 
using namespace std;
int main(){
	int n, m, sum = 0, e = 0;
	cin >> n;
	int a[n];
	memset(a, 0, sizeof(a));
	for(int i = 0; i < n; i++){
		cin >> m;
		int temp = 0, num, tsum = 0;
		cin >> tsum;
		for(int j = 1; j < m; j++){
			cin >> num;
			if(num > 0){
				if(num != tsum)
					a[i] = 1;
				tsum = num;
			}
			else tsum += num;	
		}
		sum += tsum;
	}
	for(int i = 0; i < n; i++)
		if(a[i] == 1 && a[(i + 1)%n] == 1 && a[(i + 2)%n] == 1)
			e++;
	cout << sum << ' ' << count(a, a + n, 1) << ' ' << e; 
	return 0;
}

如果对各位看官有帮助不妨留下一个点赞￣ω￣=。