Pagini recente » Cod sursa (job #2927554) | Cod sursa (job #2336791) | Cod sursa (job #969757) | Cod sursa (job #372848) | Cod sursa (job #2163344)
#include <iostream>
#include <fstream>
#include <climits>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int v[6000001], ST, BR, maxi=-999999999, start, n, stop;
long long int s;
int main()
{
// cout<<INT_MAX;
fin>>n;
for(int i=1;i<=n;i++)
{
fin>>v[i];
}
s=v[1];
start=1;
stop=1;
for(int i=2;i<=n;i++)
{
if(s+v[i]>=v[i])
{
s+=v[i];
}
else {
s=v[i];
start=i;
}
if(s>maxi)// || (s==maxi && (stop-start)<(BR-ST)))
{
maxi=s;
ST=start;
BR=i;
}
// cout<<s<<" "<<start<<" "<<stop<<endl;
}
fout<<maxi<<" "<<ST<<" "<<BR;
return 0;
}