Pagini recente » Cod sursa (job #158606) | Cod sursa (job #2998372) | Cod sursa (job #150816) | Cod sursa (job #1359509) | Cod sursa (job #2601991)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
const int nmax = 6000001;
int S[nmax], n;
int main()
{
fin >> n;
for(int i = 1; i <= n; i ++)
fin >> S[i];
int sMax = -999999999, stMax = -1, drMax = -1;
for(int st = 1; st < n; st ++)
{
int s = 0;
for(int dr = st; dr <= n; dr ++)
{
s += S[dr];
if(s > sMax)
{
sMax = s;
stMax = st;
drMax = dr;
}
}
}
fout << sMax << " " << stMax << " " << drMax;
fin.close();
fout.close();
return 0;
}