Cod sursa(job #1947441)
Utilizator | Data | 30 martie 2017 23:01:02 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include <cstdio>
using namespace std;
int main()
{
freopen("scm.in","r",stdin);
freopen("scm.out","w",stdout);
int n,i,mx=-2000000000,inf,sff,x,sprev=-1,in;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
if(sprev>mx)
mx=sprev,inf=in,sff=i-1;
scanf("%d",&x);
if(sprev+x<x)
{
sprev=x;
in=i;
}
else sprev+=x;
}
if(sprev>mx)
mx=sprev,inf=in,sff=n;
printf("%d %d %d",mx,inf,sff);
return 0;
}