Cod sursa(job #1630506)
Utilizator | Data | 5 martie 2016 09:48:24 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <cstdio>
using namespace std;
int s,S,n,is,id,beg;
int main()
{
freopen("ssm.in", "r", stdin);
freopen("ss.out", "w", stdout);
scanf("%d\n", &n);
for(int i=1; i<=n; i++)
{
int x;
scanf("%d ", &x);
if(s<0)
{
s=x;
is=i;
}
else s+=x;
if(s>S)
{
S=s;
beg=is;
id=i;
}
}
printf("%d %d %d", S,beg, id);
return 0;
}