Cod sursa(job #1150921)
| Utilizator | Data | 23 martie 2014 18:27:48 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 35 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include<cstdio>
#define M -2000000000
using namespace std;
FILE *f=fopen("ssm.in","r");
FILE *g=fopen("ssm.out","w");
long long v[6000001];int maxx=M;
int n,i,j,x,pozi,pozj;
int main()
{
fscanf(f,"%d",&n);
for(i=1;i<=n;i++)
{
fscanf(f,"%d",&x);
v[i]=v[i-1]+x;
for(j=1;j<=i;j++)
{
if(v[i]-v[j-1]>maxx)
{
maxx=v[i]-v[j-1];
pozi=j;
pozj=i;
}
}
}
fprintf(g,"%d %d %d",maxx,pozi,pozj);
return 0;
}
