Cod sursa(job #1225625)
Utilizator | Data | 3 septembrie 2014 03:59:01 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.58 kb |
#include <cstdio>
using namespace std;
int n,i,max,s,a,x,y,solx,soly;
int main()
{
freopen("ssm.in", "r", stdin);
freopen("ssm.out", "w", stdout);
scanf("%d",&n);
max=-200000000;
x=1;
for(i=1;i<=n;i++)
{
scanf("%d",&a);
if(s>=0)
{
s+=a;
y++;
}
else
{
s=a;
x=y=i;
}
if(s>max)
{
max=s;
solx=x;
soly=y;
}
}
printf("%d %d %d",max,solx,soly);
return 0;
}