Mai intai trebuie sa te autentifici.
Cod sursa(job #336530)
| Utilizator | Data | 31 iulie 2009 18:25:52 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 70 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include<stdio.h>
#define N 6000005
#define in "ssm.in"
#define out "ssm.out"
int v[N], min=N, max=0, n, suma=0, minpoz=1, maxpoz=1, i;
int main()
{
freopen(in,"r",stdin);
freopen(out,"w",stdout);
scanf("%d",&n);
for(i=1;i<=n;++i)
{
scanf("%d",&v[i]);
suma+=v[i];
if(suma<min){min=suma;minpoz=i;}
else if(suma>max){max=suma;maxpoz=i;}
}
if(minpoz>1)printf("%d %d %d",max-min, minpoz+1, maxpoz);
else printf("%d %d %d", max, minpoz, maxpoz);
return 0;
}
