Pagini recente » Cod sursa (job #2319266) | Cod sursa (job #1677466) | Cod sursa (job #2216605) | Cod sursa (job #229210) | Cod sursa (job #1582577)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int n, m=-1, start, stop, v[6000001], best[6000001], from[6000001];
void read()
{
fin>>n;
for(int i=1;i<=n;i++)
fin>>v[i];
}
int main()
{
read();
for(int i=1;i<=n;i++)
{
best[i]=v[i];
from[i]=i;
if(best[i]<best[i-1]+v[i])
{best[i] = best[i-1]+v[i];
from[i]=from[i-1];
}
if(best[i]>m)
{m = best[i];
stop = i;
start=i;
while(from[start]!=start)
start=from[start];
}
}
fout<<m<<" "<<start<<" "<<stop;
return 0;
}