洛谷P3009 [USACO11JAN]Profits S(前缀和贪心）

题目描述

The cows have opened a new business, and Farmer John wants to see how well they are doing. The business has been running for N (1 <= N <= 100,000) days, and every day i the cows recorded their net profit P_i (-1,000 <= P_i <= 1,000).

Farmer John wants to find the largest total profit that the cows have made during any consecutive time period. (Note that a consecutive time period can range in length from one day through N days.) Help him by writing a program to calculate the largest sum of consecutive profits.

奶牛们开始了新的生意，它们的主人约翰想知道它们到底能做得多好。这笔生意已经做了N（1≤N≤100,000）天，每天奶牛们都会记录下这一天的利润Pi（-1,000≤Pi≤1,000）。

约翰想要找到奶牛们在连续的时间期间所获得的最大的总利润。（注：连续时间的周期长度范围从第一天到第N天）。

请你写一个计算最大利润的程序来帮助他。

输入格式

* Line 1: A single integer: N

* Lines 2..N+1: Line i+1 contains a single integer: P_i

输出格式

* Line 1: A single integer representing the value of the maximum sum of profits for any consecutive time period.

输入输出样例

输入 #1复制

7 
-3 
4 
9 
-2 
-5 
8 
-3 

输出 #1复制

14 

说明/提示

The maximum sum is obtained by taking the sum from the second through the sixth number (4, 9, -2, -5, 8) => 14.

思路：本蒟蒻最开始拿着题虽然想了一下dp，但是偶然发现前缀和也可以做！那么就有了下面的题解。。。

#include <bits/stdc++.h>
using namespace std;
const int N =1e5+10;
#define endl '\n'
#define int long long
int a[N],f[N];
signed main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int n,cnt=0;cin>>n;
    for(int i=1;i<=n;i++){
        cin>>a[i];
        if(a[i]<0){
            cnt++;
            f[i]=a[i];//放原来的数组，因为要有一种全部为负数的情况很恶心！
        }
        a[i]=a[i-1]+a[i];//前缀和
    }
    if(cnt==n){ / /全部为负的情况，只用输出最大的一天就可以了
        sort(f+1,f+n+1);
        cout<<f[n]<<endl;
        return 0;
    }
    int mn=2e9,mx=-2e9,sum=0;//下面就类似于贪心？有小于mn的就替换，并且mx就要从后面找
    for(int i=0;i<=n;i++){//注意要从0开始判断
        if(mn>a[i]){
            mn=a[i];
            mx=-2e9;
        }
        if(mx<a[i]){
            mx=a[i];
            sum=max(sum,mx-mn);
        }
    }
    cout<<sum<<endl;
    return 0;
}