Pagini recente » Cod sursa (job #1836001) | Cod sursa (job #1963382) | Teorema chineza a resturilor - generalizari si aplicatii | Borderou de evaluare (job #2780147) | Cod sursa (job #2075679)
#include <bits/stdc++.h>
const int NMAX = 50005;
const int INF = 0x7fffffff;
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
int n, k, x, suma=-INF, sum_max, st, dr, ind;
int main() {
fin>>n>>k;
for(int i=1; i<=n; i++) {
fin>>x;
if(suma<0)
suma=x, ind=i;
else
suma+=x;
if(i-ind+1>=k && suma>sum_max) {
sum_max=suma;
st=ind;
dr=i;
}
}
fout<<st<<" "<<dr<<" "<<sum_max<<'\n';
return 0;
}