Cod sursa(job #490756)
| Utilizator | Data | 7 octombrie 2010 18:38:59 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.4 kb |
#include<cstdio>
using namespace std;
FILE *f=fopen("ssm.in","r"), *g=fopen("ssm.out","w");
long n,s[6000000],mx,i,j,inc,sf;
int main()
{
fscanf(f,"%ld %ld",&n,&s[0]);
mx=s[0];
for(i=1;i<n;i++)
{
fscanf(f,"%ld",&s[i]);
s[i]+=s[i-1];
for(j=0;j<i;j++)
if(s[i]-s[j]>mx)
{
mx=s[i]-s[j];
inc=j+2;
sf=i+1;
}
}
fprintf(g,"%ld %ld %ld",mx,inc,sf);
return 0;
}
