牛客网———最大序列和

链接：https://www.nowcoder.com/questionTerminal/df219d60a7af4171a981ef56bd597f7b
来源：牛客网

#include <stdio.h>
int main(void){
    long long n,mmax,tmp,sum;
    while(EOF!=scanf("%lld",&n)){
        mmax=0x8000000000000000;
        sum=0;
        while(n--){
            scanf("%lld",&tmp);
            sum=sum>0?sum+tmp:tmp;
            mmax=mmax>sum?mmax:sum;
        }
        printf("%lld",mmax);
    }
    return 0;
}