題目
![](https://img.laitimes.com/img/__Qf2AjLwojIjJCLyojI0JCLiAzNfRHLGZkRGZkRfJ3bs92YsYTMfVmepNHL9cGRNBTQ65UNvhkY1I1MMBjVtJWd0ckW65UbM5WOHJWa5kHT20ESjBjUIF2X0hXZ0xCMx81dvRWYoNHLrdEZwZ1Rh5WNXp1bwNjW1ZUba9VZwlHdssmch1mclRXY39CXldWYtlWPzNXZj9mcw1ycz9WL49zZuBnLycDN2EzN0QTMzIzMwAjMwIzLc52YucWbp5GZzNmLn9Gbi1yZtl2Lc9CX6MHc0RHaiojIsJye.png)
這一題也直接上代碼了
代碼
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sca=new Scanner(System.in);
int n=sca.nextInt();
int T=0,D=0,E=0;
int[] sum=new int[n];//存儲果樹上的蘋果數
int[] Earr=new int[n+2];//用于記錄該果樹是否掉落蘋果
int Enum=0;//統計連續三課掉落蘋果的果樹數
for(int i=0;i<n;i++) {
int m=sca.nextInt();
sum[i]=sca.nextInt();
boolean judge=false;;
for(int j=1;j<m;j++) {
int a=sca.nextInt();
if(a>0&&a<sum[i]) {
sum[i]=a;
judge=true;
Earr[i]=1;
}
else if(a<0) sum[i]+=a;
}
if(judge) D++;
T+=sum[i];
}
sca.close();
Earr[n]=Earr[0];
Earr[n+1]=Earr[1];
for(int i=0;i<n+2;i++)
{
if(Earr[i]==1)
Enum++;
else {
if(Enum>2)
E+=Enum-2;
Enum=0;
}
}
if(Enum>2)
E+=Enum-2;
System.out.println(T+" "+D+" "+E);
}
}