Pagini recente » Cod sursa (job #1874624) | Cod sursa (job #2055391) | Cod sursa (job #305396) | Cod sursa (job #531014) | Cod sursa (job #2545025)
#include <fstream>
#include <climits>
#define f in
#define g out
using namespace std;
ifstream in ( "secv2.in" );
ofstream out( "secv2.out" );
int n, i, k, smin = INT_MAX, maxi = INT_MIN, pozs, pozf, poz;
int v[50005], s[50005];
int main() {
f>>n>>k;
for ( i=1; i <= n; i++ ){
f>>v[i];
s[i] = s[i-1]+v[i];
}
for ( i = k; i <= n; i++ ){
if ( s[i-k] < smin ){
smin = s[i-k];
poz = i-k;
}
if ( s[i] - smin > maxi ){
maxi = s[i]-smin;
pozs = poz+1;
pozf = i;
}
}
g<<pozs<<" "<<pozf<<" "<<maxi;
return 0;
}