Cod sursa(job #1641310)
| Utilizator | Data | 8 martie 2016 22:20:23 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int i,x,s,I,J,v[6000050],istart,maxi=-999999999,n;
int main()
{
fin>>n;
for(i=0;i<n;i++)
{fin>>v[i];
if(v[i]>s+v[i])
{istart=i;
s=v[i];
}
else{ s=s+v[i];
}
if(s>maxi){
maxi=s;
I=istart;
J=i;
}
//cout<<s<<" -"<<I<<"-"<<J<<endl;
}
fout<<maxi<<" "<<I+1<<" "<<J+1;
return 0;
}
