Pagini recente » Cod sursa (job #2855198) | Cod sursa (job #1347674) | Cod sursa (job #2627726) | Cod sursa (job #166167) | Cod sursa (job #1042327)
#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
#define MAX 6000100
int a[MAX], c[MAX];
int main()
{
int n,i;
fin >> n;
for(i=1;i<=n;i++)
{
fin >> a[i];
}
c[0]=-1;
for(i=1;i<=n;i++)
c[i]= max(a[i],c[i-1]+a[i]);
int mx=c[1],l=1,p;
bool ok=true;
for(i=n;i>=0;i--)
{
if(c[i]>mx)
mx=c[i],l=i;
}
for(i=l;i>=0;i--)
if(ok==true && c[i-1]<0)
{p=i;break;}
fout << mx << " " << p << " " << l << "\n";
return 0;
}