Cod sursa(job #514026)
Utilizator | Munteanu Valentin CyberneticLord | Data | 17 decembrie 2010 16:31:31 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 85 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include<fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
long long n,v[6000000],i,j,k,smax=-2,s,bestSum =-2, beg=0,end,idx=1,Min;
int main()
{
fin>>n;
for(i=1;i<=n;i++) fin>>v[i];
for(i=1;i<=n;i++) {
v[i]+=v[i - 1];
if (bestSum < v[i] - Min)
{bestSum = v[i] - Min, beg = idx, end = i;}
if (Min > v[i])
Min = v[i], idx =i+1;
}
fout<<bestSum<<" "<<beg<<" "<<end;
return 0;
}