Pagini recente » Cod sursa (job #2798246) | Cod sursa (job #1288978) | Cod sursa (job #108035) | Cod sursa (job #2761369) | Cod sursa (job #1571370)
#include<iostream>
#include<fstream>
#include<limits.h>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int maxim (int a, int b)
{
if (a>b)
return a;
else if (b>a)
return b;
}
int best[6000001];
int main ()
{
int n;
fin>>n;
int maxim2=-INT_MAX;
int inceput=0;
int sfarsit=0;
for (int i=1;i<=n;i++)
{
int x;
fin>>x;
best[i]=maxim(best[i-1]+x,x);
if (best[i]==x)
{
inceput=i;
}
if (best[i]>maxim2)
{
maxim2=best[i];
sfarsit=i;
}
}
fout<<maxim2<<" "<<inceput<<" "<<sfarsit;
}