小明种苹果(续)"/>
csp 201909-2 小明种苹果(续)
解答:
#include <stdio.h>int main(){int n,m,i,j,total,temp,t=0,d=0,e=0,bi=-1;scanf("%d",&n);int iless[1000]={0};for(i=0; i<n; i++){scanf("%d",&m);scanf("%d",&total);for(j=1; j<m; j++){scanf("%d",&temp);if(temp>0){if(total > temp){if(bi!=i){d++;bi=i;}iless[i]=1;}total = temp;}else{total += temp;}}t+=total;}int k;for(i=0; i<n; i++){j=(i+1)%n;k=(j+1)%n;if(iless[i] && iless[j] && iless[k]){e++;}}printf("%d %d %d",t,d,e);return 0;
}
更多推荐
csp 201909-2 小明种苹果(续)
发布评论