Pagini recente » Cod sursa (job #2538279) | Cod sursa (job #1524392) | Monitorul de evaluare | Cod sursa (job #1974002) | Cod sursa (job #1499958)
#include <fstream>
#define NMAX 6000006
#define MIN -2000000000
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int n;
int p[NMAX];
int a[NMAX];
int main()
{
in>>n;
for(int i=1;i<=n;i++)
in>>a[i];
in.close();
long long int maxx = MIN;
int pozi = 1,pozf = 1;
int pi = 1,pf =1;
p[1] = a[1];
for(int i=2;i<=n;i++)
{
if(a[i]>p[i-1]+a[i])
{
p[i] = a[i];
pozi = i;
pozf = i;
}
else
{
p[i] = p[i-1]+a[i];
pozf=i;
}
if(maxx<p[i])
{
maxx = p[i];
pi = pozi;
pf = pozf;
}
}
out<<maxx<<" "<<pi<<" "<<pf<<'\n';
out.close();
return 0;
}