Cod sursa(job #1837290)
Utilizator | Data | 29 decembrie 2016 14:25:59 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <stdio.h>
using namespace std;
int main()
{
FILE *fin,*fout;
int n,s,max,a,i,i1,i2,i3;
fin=fopen("smm.in","r");
fout=fopen("smm.out","w");
fscanf(fin,"%d",&n);
s=0;
max=-1000000000;
for(i=0;i<n;i++)
{
fscanf(fin,"%d",&a);
if(s<0)
{
i1=i;
s=0;
}
s=s+a;
if(s>max)
{
i2=i;
i3=i1;
max=s;
}
}
fprintf(fout,"%d %d %d\n",max,i3+1,i2+1);
return 0;
}