Pagini recente » Cod sursa (job #1078391) | Cod sursa (job #834921) | Cod sursa (job #425903) | Cod sursa (job #650546) | Cod sursa (job #1912606)
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n;
long long a[10000],smax[10000];
int Max(int a,int b)
{
if(a>b)return a;
return b;
}
int main()
{
int i,si,sj,maxx;
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
smax[1]=a[1];
maxx=a[1];
si=1;
sj=1;
for(i=2;i<=n;i++)
{
smax[i]=Max(smax[i-1]+a[i],a[i]);
if(smax[i]==a[i])
{
si=i;
sj=i;
}
else sj++;
if(maxx<smax[i])
maxx=smax[i];
}
g<<maxx<<" "<<si<<" "<<sj-1;
return 0;
}