Cod sursa(job #1367979)
Utilizator | Data | 2 martie 2015 12:30:41 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <cstdio>
using namespace std;
int n, v[6000010], s, maxim=-(1<<30), p, u, i, x, y;
int main(){
freopen("ssm.in", "r", stdin);
freopen("ssm.out", "w", stdout);
scanf("%d", &n);
for(i=1; i<=n; i++)
scanf("%d", &v[i]);
for(i=1; i<=n; i++)
{
s+=v[i];
u=i;
if(v[i]>s)
p=i, s=v[i];
if(s>maxim)
maxim=s, x=p, y=u;
}
printf("%d %d %d\n", maxim, x, y);
return 0;
}