Pagini recente » Cod sursa (job #3162995) | Cod sursa (job #1162033) | Cod sursa (job #3002014) | Cod sursa (job #2560787) | Cod sursa (job #2092460)
#include <climits>
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int v[6000001], n;
int main()
{
int sum=0, bestSum=INT_MIN, beg, endd, idx=1;
f>>n;
for(int i=1; i<=n; i++)
f>>v[i];
for(int i=1; i<=n; i++)
{
if(sum<0)
sum=v[i], idx=i;
else sum+=v[i];
if(sum>bestSum)
{
bestSum=sum;
beg=idx;
endd=i;
}
}
g<<bestSum<<" "<<beg<<" "<<endd;
f.close();
g.close();
return 0;
}