Cod sursa(job #2302783)
Utilizator | Data | 15 decembrie 2018 10:10:01 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 90 |
Compilator | c-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include<stdio.h>
int n,i,j=1,k=1,s,b,m=-1000,l=1,t;
int main() {
freopen("ssm.in","r",stdin),freopen("ssm.out","w",stdout),scanf("%d",&n);
for(i=1;i<=n;i++) {
scanf("%d",&t);
if(b>s)
b=s,l=i;
s+=t;
if(m<s-b)
m=s-b,k=i;
if(l<=k)
j=l;
}
printf("%d %d %d",m,m<0?k:j,k);
}