Pagini recente » Cod sursa (job #754825) | Cod sursa (job #1202518) | Cod sursa (job #1219970) | Cod sursa (job #1421613) | Cod sursa (job #3285165)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fcin("ssm.in");
ofstream fout("ssm.out");
int n, x, s[6000001], st, dr;
int MIN, bestSum;
int main()
{
fcin>>n;
for (int i=1; i<=n; i++)
{
fcin>>x;
s[i]=s[i-1]+x;
}
MIN=1;
bestSum=1;
for (int i=2; i<=n; i++)
{
if(bestSum<s[i]-s[MIN])
{
bestSum=s[i]-s[MIN];
st=MIN+1;
dr=i;
}
if(s[MIN]> s[i])
MIN=i;
}
fout<<bestSum<<" "<<st<<" "<<dr;
}