Pagini recente » Cod sursa (job #2758577) | Cod sursa (job #1429293) | Cod sursa (job #1362505) | Cod sursa (job #2592011) | Cod sursa (job #670978)
Cod sursa(job #670978)
#include<fstream>
using namespace std;
ifstream cin("ssm.in");
ofstream cout("ssm.out");
int a[7000005], S[7000005], n;
int main()
{
int bestSum = -int(2e9), min = 0, idx, beg, end, i;
cin>>n;
for(i=1;i<=n;i++)
cin>>S[i];
for(i=1;i<=n;i++)
{ S[i]=S[i]+S[i-1];
if (bestSum < S[i] - min)
bestSum = S[i] - min, beg = idx + 1, end = i;
if (min > S[i])
min = S[i], idx = i;
}
cout << bestSum << " " << beg << " " << end;
return 0;
}