Pagini recente » Cod sursa (job #1944564) | Istoria paginii summer-challenge-2009/solutii/runda-2 | Cod sursa (job #1279479) | Cod sursa (job #2596444) | Cod sursa (job #2785258)
#include <fstream>
#define N
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
long long n;
int main()
{
long long i,sum,pr,ul,x,Max,ct;
fin>>n;
fin>>x;
Max=sum=x;
pr=ul=ct=1;
for(i=2; i<=n; ++i)
{
fin>>x;
sum+=x; ct++;
if(sum<0) {sum=x; ct=1;}
if(sum>Max)
{ Max=sum;
pr=i-ct+1;
ul=i;
}
}
fout<<Max<<" "<<pr<<" "<<ul;
return 0;
}