Java實現
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
ccf2();
}
public static void ccf2() {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int t = 0, d = 0, e = 0;
int[] arr = new int[n];
for(int i=0; i<n; i++) {
int m = in.nextInt();
int sum = 0;
for(int j=0; j<m; j++) {
int s = in.nextInt();
sum += s;
//如果s大於0,並且不是第一個數
if(s>0 && j>0) {
sum -= s;
//掉蘋果
if(sum > s) {
//從當前值重新計數
sum = s;
//前面未統計過
if(arr[i]!=1) {
d++;
arr[i]=1;
}
}
}
}
t+=sum;
}
//統計連續組數
for(int i=0; i<n; i++) {
if(arr[i]==1 && arr[(i+1)%n]==1 && arr[(i+2)%n]==1) {
e++;
}
}
System.out.println(t+" "+d+" "+e);
in.close();
}
}