MOOC 01-复杂度1 最大子列和问题

 1 #include<stdio.h>
 2 int main(){
 3     int result = 0,thissum = 0, N, digit;
 4     scanf("%d", &N);
 5     for(int i = 0; i < N; i++){
 6         scanf("%d", &digit);
 7         thissum += digit;
 8         if(thissum > result)
 9             result = thissum;
10         if(thissum < 0)   thissum = 0;
11     }
12     printf("%d", result);
13     return 0;
14 }