Partial Sum (2017湘潭)

Partial Sum

Partial Sum Bobo has a integer sequence  a1,a2,…,an  of length  n . Each time, he selects two ends  0≤l<r≤n  and add  |∑rj=l+1aj|−C   into a counter which is zero initially. He repeats the selection for at most  m  times. If each end can be selected at most once (either as left or right), find out the maximum sum Bobo may have. Input The input contains zero or more test cases and is terminated by end-of-file. For each test case: The first line contains three integers  n ,  m ,  C . The second line contains  n  integers  a1,a2,…,an . 2≤n≤105 1≤2m≤n+1 |ai|,C≤104 The sum of  n  does not exceed  106 . Output For each test cases, output an integer which denotes the maximum. Sample Input 4 1 1 -1 2 2 -1 4 2 1 -1 2 2 -1 4 2 2 -1 2 2 -1 4 2 10 -1 2 2 -1 Sample Output 3 4 2 0 Source XTU OnlineJudge

[  Submit Solution ]

题意：输入n个数字你可已选择（0~m）对个端点，不过每个端点只能选择一次；然后选择的端点带入表达式 |∑rj=l+1aj|−C  ，题意要求选择端点得最大值；

思路：根据目标表达式，我们知道要求的是两个端点之间的a[]值的和，所以预处理一下前缀和S[]，则S[i]-S[j-1]就是j-i之间的和；预处理完之后我们再对S[]进行排序便可；注意S[0]=0，思考一下；

代码：

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn=100005;
const int inf=1e9;
typedef long long ll;

ll S[maxn];
int main()
{
    int n,m,c;
    while(~scanf("%d%d%d",&n,&m,&c))
    {
        memset(S,0,sizeof(S));
        for(int i=1;i<=n;i++)
        {
            int a;
            scanf("%d",&a);
            S[i]=S[i-1]+a;
        }
        sort(S,S+n+1);

//        for(int i=0;i<=n;i++)
//            printf("%d ",S[i]);
//        printf("\n");

        ll ans=0,sum=0;
        for(int i=0;i<m;i++)
        {
            sum=S[n-i]-S[i]-c;
            if(sum<=0) break;
            ans+=sum;
        }
        printf("%I64d\n",ans);
    }
    return 0;
}