Pagini recente » Cod sursa (job #1653556) | Cod sursa (job #2893679) | Cod sursa (job #602046) | Cod sursa (job #1489428) | Cod sursa (job #3151750)
#include <fstream>
#include <climits>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
const int nmax = 6000005;
int n, A[nmax], sumi, maxi = INT_MIN, pi, pf;
int main()
{
f >> n;
for(int i = 1; i <= n; i ++)
f >> A[i];
int p = 1;
for(int i = 1; i <= n; i ++)
{
if(sumi < 0)
sumi = 0, p = i;
sumi += A[i];
if(maxi < sumi)
{
pi = p;
pf = i;
maxi = sumi;
}
}
g << maxi << " " << pi << " " << pf;
return 0;
}