Cod sursa(job #993727)
Utilizator | Data | 4 septembrie 2013 12:57:01 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include "stdio.h"
using namespace std;
int i,j,k,l,m,n,s1,s2,s3;
FILE *in,*out;
int main()
{
in=fopen("ssm.in","r");
fscanf(in,"%d",&n);
for (i=0; i<n; i++)
{
fscanf(in,"%d",&j);
if (i==0) {k=0; l=0; m=j; s1=m; s2=k; s3=l;} else
{
if (m+j>j) {m=m+j; l++;} else {m=j; k=i; l=i;}
if (m>s1) {s1=m; s2=k; s3=l;}
}
}
s2++;
s3++;
out=fopen("ssm.out","w");
fprintf(out,"%d %d %d",s1,s2,s3);
fclose(out);
return 0;
}