Cod sursa(job #288082)
Utilizator | A Andrei AnDrEwBoY | Data | 25 martie 2009 15:43:52 |
---|---|---|---|
Problema | Secventa 2 | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.6 kb |
#include<stdio.h>
long sum[50000];
int main()
{
long min = 0,ipx = 0,bestS = -1250000000,n,k,i,st,dr;
freopen("secv2.in","r",stdin);
freopen("secv2.out","w",stdout);
scanf("%ld %ld",&n,&k);
for(i = 0; i < n; i++)
scanf("%ld",&sum[i]);
for(i = 0; i < n; i++)
{
sum[i] += sum[i-1];
if(bestS < sum[i] - min)
bestS = sum[i] - min,st = ipx+1,dr = i;
if(min > sum[i])
min = sum[i],ipx = i;
}
printf("%ld %ld %ld",st+1,dr+1,bestS);
fclose(stdin); fclose(stdout);
return 0;
}