ccf csp 题目：小明种苹果（续）

#include<iostream>

using namespace std;

const int N=1000000;
int **a = new int *[N];

int main(){
	int n, b;
	cin >> n;
	int *q = new int[n]; 
	for(int i = 0; i < n; i++){
		a[i] = new int[1000+1];
	}
	for(int i = 0; i < n; i++){
		q[i] = 0;
	}
	for(int i = 0; i < n; i++){
		cin >> a[i][0];
		b = a[i][0];
		for(int j = 1; j < b+1; j++){
			cin >> a[i][j];
		}
	}
	int t = 0, sum = 0, d = 0, e = 0;//t记录每颗树的剩余 ，sum记录总树的总剩余 ,d记录苹果掉落的棵数 ,e记录连续三颗树掉落的组数 
	for(int i = 0; i < n; i++){
		b = a[i][0];
		int p = 0;
		if(b > 1){
			//计算总树的总剩余 
			for(int j = b; j > 0; j--){
				if(a[i][j] < 0 || a[i][j] == 0){
					p += (-a[i][j]);
				}
				if(a[i][j] > 0){
					t = a[i][j] - p;
					break;
				}
			}
			sum += t;
			//计算苹果掉落的棵数
			for(int j = b; j > 1; j--){
				if(a[i][j] > 0){
					for(int k = 1; k < j; k++){
						if(a[i][k+1] < 0){
							a[i][k+1] = -a[i][k+1];
							a[i][1] -= a[i][k+1];
						}
					}
					if(a[i][1] > a[i][j]){
						d++; 
						q[i] = i+1;
					}
					break;
				}
			}
		}else{
			t = a[i][1];
			sum += t;
		}
	}
	//连续三颗树掉落的组数
		if(d >= 3){
			if(n >=3){
				if((q[0] * q[1] * q[n-1]) != 0){
					e++;
				}
				if((q[n-2] * q[n-1] * q[0]) != 0){
					e++;
				}
				for(int i = 1; i < n-1; i++){
					if((q[i] * q[i-1] * q[i+1]) != 0){
						e++;
					}
				}
			}
		}
	cout << sum << " " << d << " " << e;
	return 0;
}