Cod sursa(job #1685099)
Utilizator | Data | 11 aprilie 2016 15:08:21 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <cstdio>
#include <climits>
using namespace std;
int ma=INT_MIN,n,i,in,inn,s,x,sf;
int main()
{
freopen("ssm.in","r",stdin);
freopen("ssm.out","w",stdout);
scanf("%d",&n);
in=1;
for(i=1; i<=n; ++i)
{
scanf("%d",&x);
s+=x;
if(s>ma)
{
inn=in;
sf=i;
ma=s;
}
if(s<0)
{
in=i;
s=x;
}
}
printf("%d %d %d\n",ma,inn,sf);
return 0;
}