MOOC 01-复杂度2 Maximum Subsequence Sum

标签：flag   scan   else   c++   return   first   maximum   复杂   ++   

#include <stdio.h>
int main(){
    int n, flag = 1, first_flag = 1, positive_flag = 0;
    int sum = 0, summax = 0;
    int st = 0, end = 0, st_max = 0, end_max = 0, first = 0;
    scanf("%d", &n);
    for(int i = 0; i < n; i++){
        scanf("%d", &end);
        first_flag && (first = end) && (first_flag = 0); // 短路求值
        end >= 0 && (positive_flag = 1);                 // 短路求值
        !flag || (flag = 0) || (st = end);               // 短路求值
        sum += end;
        if (summax < sum){
            summax = sum;
            st_max = st;
            end_max = end;
        }
        !(sum < 0)||!(flag = 1)||(sum = 0);          // 短路求值
    }
    if (positive_flag)
        printf("%d %d %d", summax, st_max, end_max);
    else
        printf("%d %d %d", summax, first, end);
    return 0;
}

MOOC 01-复杂度2 Maximum Subsequence Sum

标签：flag   scan   else   c++   return   first   maximum   复杂   ++   

原文地址：https://www.cnblogs.com/zjsaipplp/p/10424843.html