Pagini recente » Cod sursa (job #1135322) | Cod sursa (job #1101354) | Cod sursa (job #1427763) | Cod sursa (job #2734857) | Cod sursa (job #662899)
Cod sursa(job #662899)
#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>>a[i];
for(i=1;i<=n;i++)
{ S[i]=S[i]+a[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;
}