题目
代码
#include <stdio.h>
#include <stdlib.h>
int main(void){
int n,m,i,j;
int **tree;
int sum=0,num=0,count=0;
int E=0;
scanf("%d",&n);
tree=(int **)malloc(n*sizeof(int *));
for(i=0;i<n;i++){
scanf("%d",&m);
tree[i]=(int *)malloc((m+1)*sizeof(int));
tree[i][0]=0;
for(j=1;j<=m;j++){
scanf("%d",&tree[i][j]);
if(tree[i][j]>0){
if(j!=1&&tree[i][0]!=1&&sum!=tree[i][j])
tree[i][0]=1;
sum=tree[i][j];
}
else
sum+=tree[i][j];
}
num+=sum;
}
for(i=0;i<n;i++){
count+=tree[i][0];
if(i==n-1&&tree[i][0]==1){
if(tree[i-1][0]==1&&tree[0][0]==1)
E++;
}
else if(i==0&&tree[i][0]==1){
if(tree[i+1][0]==1&&tree[n-1][0]==1)
E++;
}
else{
if(tree[i][0]==1&&tree[i-1][0]==1&&tree[i+1][0]==1)
E++;
}
}
printf("%d %d %d",num,count,E);
return 0;
}
输入样例1:
4
4 74 -7 -12 -5
5 73 -8 -6 59 -4
5 76 -5 -10 60 -2
5 80 -6 -15 59 0