Pagini recente » Cod sursa (job #1369924) | Cod sursa (job #683487) | Cod sursa (job #1605064) | Cod sursa (job #1569568) | Cod sursa (job #2076484)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int N,s[6000000],sp[6000000],i,j;
int main()
{
int INT_MAX=0x3f3f3f3f;
in>>N;
for(i=0;i<N;++i)
in>>s[i];
for(i=0;i<N;++i)
for(j=0;j<=i;++j)
sp[i]+=s[j];
int M=sp[0];
for(i=1;i<N;++i)
if(sp[i]>M)
M=sp[i];
int max=-INT_MAX,ii,jj;
for(int i=0;i<=M;++i)
for(j=1+i;j<=M;++j)
if((sp[j]-sp[i-1])>max)
{
ii=i+1;
jj=j+1;
max=sp[j]-sp[i-1];
}
out<<max<<' '<<ii<<' '<<jj;
return 0;
}