Pagini recente » Cod sursa (job #969796) | Cod sursa (job #390289) | Cod sursa (job #1879526) | Cod sursa (job #2631280) | Cod sursa (job #904770)
Cod sursa(job #904770)
#include <stdio.h>
#include <algorithm>
using namespace std;
FILE *f,*s;
int n,i;
int v[6000005];
int main()
{
f=fopen("ssm.in","r");
s=fopen("ssm.out","w");
fscanf(f,"%d",&n);
for(i=1;i<=n;i++)
fscanf(f,"%d",&v[i]);
int max=-2000000;
int x=0,y=0,z=0;
int sum=0;
for(i=1;i<=n;i++)
{
if(sum<0)
{
sum=v[i];
z=i;
}
else
sum+=v[i];
if (max<sum)
{
max=sum;
x=z;
y=i;
}
}
fprintf(s,"%d %d %d",max,x,y);
fclose(s);
return 0;
}