Cod sursa(job #1619056)
Utilizator | Data | 28 februarie 2016 11:58:32 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <cstdio>
using namespace std;
int i1,i2,im,Min,Max,n,i,a;
long long s;
int main()
{
freopen("ssm.in", "r", stdin);
freopen("ssm.out", "w", stdout);
scanf("%d", &n);
for(i=1;i<=n;++i){
scanf("%d", &a);
s=s+a;
if(s-Min>Max){
Max=s-Min;
i1=im+1;i2=i;
}
if(s>Max){
Max=s;
i1=1;im=i+1;
}
if(s<Min)
Min=s,im=i;
}
printf("%d %d %d", Max,i1,i2);
return 0;
}