Cod sursa(job #165021)
Utilizator | Sebastian Crisan c_sebi | Data | 25 martie 2008 09:04:34 |
---|---|---|---|
Problema | Secventa 2 | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.54 kb |
#include <fstream.h>
#define nmax 5000
long a[nmax], sum[nmax], n, k, sm, Max=-2000000000, min=2000000000, pi, pf;
int main(){
ifstream f("secv2.in");
ofstream g("secv2.out");
f>>n>>k;
int i;
for(i=1; i<=n; i++){
f>>a[i];
sum[i] = sum[i-1] + a[i];
}
for(i=k; i<=n; i++){
if(sum[i-k] < min) min = sum[i-k], pi=i-k+1;
sm = sum[i] - min;
if(sm > Max) Max = sm, pf=i;
}
g<<pi<<" "<<pf<<" "<<Max<<"\n";
f.close();
g.close();
return 0;
}