Cod sursa(job #1095690)
Utilizator | Data | 31 ianuarie 2014 18:16:54 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 95 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include<fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int s[6000005],i,n,j,v,m,b,e,mini,k;
int main()
{
fin >> n;
for (i=1; i<=n; i++)
{
fin >> v;
s[i]=s[i-1]+v;
if (s[i]-mini>m)
{
m=s[i]-mini;
b=k+1;
e=i;
}
if (mini>s[i])
{
mini=s[i];
k=i;
}
}
fout << m << " " << b << " " << e;
fin.close();
fout.close();
return 0;
}