Codeforces-846C：Four Segments

C. Four Segments

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

You are given an array of n integer numbers. Let sum(l, r) be the sum of all numbers on positions from l to r non-inclusive (l-th element is counted, r-th element is not counted). For indices l and r holds 0 ≤ l ≤ r ≤ n. Indices in array are numbered from 0.

For example, if a = [ - 5, 3, 9, 4], then sum(0, 1) =  - 5, sum(0, 2) =  - 2, sum(1, 4) = 16 and sum(i, i) = 0 for each i from 0 to 4.

Choose the indices of three delimiters delim0, delim1, delim2 (0 ≤ delim0 ≤ delim1 ≤ delim2 ≤ n) and divide the array in such a way that the value of res = sum(0, delim0) - sum(delim0, delim1) + sum(delim1, delim2) - sum(delim2, n) is maximal.

Note that some of the expressions sum(l, r) can correspond to empty segments (if l = r for some segment).

Input

The first line contains one integer number n (1 ≤ n ≤ 5000).

The second line contains n numbers a0, a1, ..., an - 1 ( - 109 ≤ ai ≤ 109).

Output

Choose three indices so that the value of res is maximal. If there are multiple answers, print any of them.

Examples

input

3
-1 2 3

output

0 1 3

input

4
0 0 -1 0

output

0 0 0

input

1
10000

output

1 1 1

思路：把a数组分成4个区间s1,s2,s3,s4,求max(s1-s2+s3-s4)，预处理出max(s1-s2),max(s3-s4),时间复杂度O(n^2),ans=max(max(s1-s2)+max(s3-s4));

#include<bits/stdc++.h>
using namespace std;
const int MAX=6000;
__int64 a[MAX];
struct lenka
{
    __int64 sum;
    int x;
}pre[MAX],suf[MAX];
__int64 presum[MAX],sufsum[MAX];
int main()
{
    int n;
    memset(presum,0,sizeof presum);
    memset(sufsum,0,sizeof sufsum);
    scanf("%d",&n);
    for(int i=1;i<=n;i++)scanf("%I64d",&a[i]);
    for(int i=1;i<=n;i++)presum[i]=presum[i-1]+a[i];//预处理出前缀和
    for(int i=n;i>=1;i--)sufsum[i]=sufsum[i+1]+a[i];//预处理出后缀和
    for(int i=0;i<=n+1;i++)pre[i].sum=suf[i].sum=-1e18;
    for(int i=0;i<=n;i++)
    {
        for(int j=0;j<=i;j++)
        {
            if(2*presum[j]-presum[i]>pre[i].sum)//求max(s1-s2)并记录下delim0
            {
                pre[i].sum=2*presum[j]-presum[i];
                pre[i].x=j+1;
            }
        }
    }
    for(int i=n+1;i>=1;i--)
    {
        for(int j=n+1;j>=i;j--)
        {
            if(suf[i].sum<sufsum[i]-2*sufsum[j])//求max(s3-s4)并记录下delim2
            {
                suf[i].sum=sufsum[i]-2*sufsum[j];
                suf[i].x=j;
            }
        }
    }
    __int64 ans=-1e18;
    int x,y,z;
    for(int i=0;i<=n;i++)
    {
        if(pre[i].sum+suf[i+1].sum>ans)//求max(max(s1-s2)+max(s3-s4))
        {
            ans=pre[i].sum+suf[i+1].sum;
            x=pre[i].x;
            y=i+1;
            z=suf[i+1].x;
        }
    }
    printf("%d %d %d\n",x-1,y-1,z-1);
    return 0;
}