Pagini recente » Cod sursa (job #1554073) | Cod sursa (job #1859939) | Cod sursa (job #2279159) | Cod sursa (job #2662068) | Cod sursa (job #1750837)
#include<fstream>
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
long long s[50005], maxim, minim;
int st, dr, poz, n, k, x;
int main(){
fin >> n >> k;
for( int i = 1; i <= n; i++ ){
fin >> x;
s[i] = s[i - 1] + x;
}
minim = 20000000000000000LL;
maxim = 0;
for( int i = k; i <= n; i++ ){
if( minim > s[i - k] ){
minim = s[i - k];
poz = i - k + 1;
}
if( s[i] - minim > maxim ){
maxim = s[i] - minim;
st = poz;
dr = i;
}
}
fout << st << " " << dr << " " << maxim;
return 0;
}