Cod sursa(job #412312)
Utilizator | Data | 5 martie 2010 14:46:21 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 80 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include<fstream>
using namespace std;
int v[6000005],s[6000005],x[6000005];
int n;
int main ()
{
int i,j;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
fin>>n;
for(i=1;i<=n;i++)
fin>>v[i];
for(i=1;i<=n;i++)
s[i]=s[i-1]+v[i];
int minim=s[1],maxim=s[1],i1=1,j1=1,i2=1;
for(i=2;i<=n;i++)
{
x[i]=s[i]-minim;
if(s[i]<minim) {minim=s[i];i2=i;}
if(x[i]>maxim) {maxim=x[i];i1=i2+1;j1=i;}
}
fout<<maxim<<' '<<i1<<' '<<j1;
fin.close();
fout.close();
return 0;
}