Pagini recente » Cod sursa (job #3189804) | Cod sursa (job #1460841) | Cod sursa (job #2215874) | Cod sursa (job #3123544) | Cod sursa (job #811927)
Cod sursa(job #811927)
#include <stdio.h>
using namespace std;
FILE *f=fopen("ssm.in","r");
FILE *g=fopen("ssm.out","w");
int s[6000300],max,o,p,n,i,j,x;
int main()
{
fscanf(f,"%d",&n);
for(i=1;i<=n;i++)
{fscanf(f,"%d",&x);
s[i]=s[i-1]+x;
}
max=0;
for(i=1;i<=n-1;i++)
for(j=i+1;j<=n;j++)
{ if (s[j]>s[i])
if (s[j]-s[i]>max) {max=s[j]-s[i];o=i+1;p=j;}
if (s[j]-s[i]==max && j-i-1<p-o){max=s[j]-s[i];o=i+1;p=j;}
}
fprintf(g,"%d% d %d",max,o,p);
fclose(g);
return 0;
}