CCF CSP Brush Question Record 31-201909-2 Xiaoming Apples (continued) (Java)

import java.util.Scanner;
public class 小明种苹果2 {

	public static void main(String[] args) {
		  Scanner sc = new Scanner(System.in);
	        int n = sc.nextInt();
	        int[][] a=new int[n][1001];
	        for(int i=0;i<n;i++){
	        	a[i][0]=sc.nextInt();
	        	for(int j=1;j<=a[i][0];j++){
	        		a[i][j]=sc.nextInt();
	        	}
	        }
	        int t=0;
	        int[] d=new int[n];//每棵树有没有掉落的
	        int e=0;
	        int[] p=new int[n];//每棵树剩的数量
	        for(int i=0;i<n;i++){
	        	p[i]=a[i][1];
	        }
	        
	        for(int i=0;i<n;i++){
	        	for(int j=2;j<=a[i][0];j++){
	        		if(a[i][j]<=0){
	        			p[i]+=a[i][j];
	        		}else{
	        			if(p[i]>a[i][j]){
	        				d[i]=1;
	        				p[i]=a[i][j];
	        			}else{
	        				p[i]=a[i][j];
	        			}
	        		}
	        	}
	        }
	        
	        for(int i=0;i<n;i++){
	        	// System.out.println(p[i]);
	        	t+=p[i];
	        }
	        int D=0;
	        for(int i=0;i<n;i++){
	        	D+=d[i];
	        }
	        for(int i=1;i<n-1;i++){
	        	if(d[i-1]==1&&d[i]==1&&d[i+1]==1){
	        		e++;
	        	}
	        }
	        if(d[n-2]==1&&d[n-1]==1&&d[0]==1){
	        	e++;
	        }
	        if(d[n-1]==1&&d[1]==1&&d[0]==1){
	        	e++;
	        }
	        
	        System.out.println(t+" "+D+" "+e);
	}

}