Pagini recente » Istoria paginii summer-challenge-2009/clasament/runda-2 | Cod sursa (job #1706625) | Cod sursa (job #3208586) | Cod sursa (job #2442718) | Cod sursa (job #519925)
Cod sursa(job #519925)
#include<stdio.h>
FILE*fin,*fout;
long int a[6000002],i,j,sb,min,max,n,st,dr,p;
int main(){
fin=fopen("ssm.in","r");
fout=fopen("ssm.out","w");
fscanf(fin,"%ld",&n);
for(i=1;i<=n;i++){
fscanf(fin,"%ld ",&a[i]);
a[i]=a[i]+a[i-1];
}
max=a[1];
min=0;p=0;st=0;
for(i=1;i<=n;i++){
sb=a[i]-min;
if(i==1){sb=a[i];}
if(sb>max){max=sb;st=p+1;dr=i;}
if(a[i]<min){min=a[i];p=i;}
}
fprintf(fout,"%ld %ld %ld",max,st,dr);
return 0;}