Cod sursa(job #1390048)
| Utilizator | Data | 16 martie 2015 20:20:28 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.64 kb |
#include <iostream>
#include <fstream>
#define LL long long int
using namespace std;
LL K,N,sum[50010];
int main(){
ifstream fin("secv2.in");
ofstream fout("secv2.out");
fin >> N >> K;
LL i,x,l,r,MAX=-(1LL<<60),mins=(1LL<<60),mind;
for (i=1; i<=N; i++){
fin >> x;
sum[i]=sum[i-1]+x;
}
for (i=K; i<=N; i++){
if (mins>sum[i-K]){
mins=sum[i-K];
mind=i-K;
}
if (sum[i]-mins>MAX){
MAX=sum[i]-mins;
l=mind+1;
r=i;
}
}
fout << l << " " << r << " " << MAX << "\n";
return 0;
}
