Pagini recente » Cod sursa (job #952514) | Cod sursa (job #1334374) | Cod sursa (job #1939465) | Cod sursa (job #2134874) | Cod sursa (job #812216)
Cod sursa(job #812216)
#include <stdio.h>
#include <stdlib.h>
using namespace std;
FILE *f=fopen("ssm.in","r");
FILE *g=fopen("ssm.out","w");
int s[6000300],best[6000300],max,o,p,n,i,min,x,k;
int main()
{
fscanf(f,"%d",&n);
for(i=1;i<=n;i++)
{fscanf(f,"%d",&x);
s[i]=s[i-1]+x;
}
min=9999999;
max=-99999999;
for (i=1;i<=n;i++)
{
best[i]=s[i]-min;
if (min>s[i]){min=s[i];k=i+1;}
if (max<best[i]) {max=best[i];p=k;o=i;}
}
if (p>o)p=o;
fprintf(g,"%d %d %d",max,p,o);
fclose(g);
return 0;
}