Pagini recente » Cod sursa (job #2388190) | Cod sursa (job #2600060) | Cod sursa (job #724999) | Cod sursa (job #223701) | Cod sursa (job #2326721)
#include <iostream>
#include <fstream>
using namespace std;
const int MAX=6000000;
int n,v[MAX];
ifstream in("ssm.in");
ofstream out("ssm.out");
int main()
{
in>>n;
for(int i=1;i<=n;i++) in>>v[i];
int bestsum=-2e8, s=0, start, end, ind;
for(int i=1;i<=n;i++)
{
if(s<0)
{
s=v[i];
ind=i;
}
else s+=v[i];
if(bestsum<s)
{
bestsum=s;
start=ind;
end=i;
}
}
out<<bestsum<<" "<<start<<" "<<end;
return 0;
}