Cod sursa(job #1889460)
Utilizator | Andrei Gasparovici andreigasparovici | Data | 22 februarie 2017 18:48:21 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.59 kb |
#include <cstdio>
#include <iostream>
using namespace std;
#define NMAX 6000004
#define INF (1<<30)
int n;
int a[NMAX], best[NMAX];
int sol, sum, start, stop, start2;
int main()
{
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
scanf("%d ",&n);
sol = -INF;
for(int i=1;i<=n;i++)
{
scanf("%d ",&a[i]);
if(sum<0)
sum=a[i],start2=i;
else sum+=a[i];
if(sum>sol)
{
sol = sum;
stop=i;
start = start2;
}
}
printf("%d %d %d",sol,start,stop);
return 0;
}