Cod sursa(job #609672)
| Utilizator |  Andrei Geogescu mening12001 |
Data | 22 august 2011 19:17:04 |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 25 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.33 kb |
#include<fstream.h>
long long a[6000000],s[6000000];
int main()
{ifstream f("ssm.in");
ofstream h("ssm.out");
long long max=0,n,i,j,x,y;
f>>n;
s[0]=0;
for(i=1;i<=n;i++)
{f>>a[i];
s[i]=a[i]+s[i-1];}
for(i=1;i<n;i++)
for(j=i+1;j<=n;j++)
if(s[j]-s[i]>max)
{max=s[j]-s[i];
x=i;
y=j;}
h<<max<<" "<<x+1<<" "<<y;
return 0;}