CodeForces 363B Fence

Fence

Time Limit: 1000ms
Memory Limit: 262144KB
This problem will be judged on CodeForces. Original ID: 363B
64-bit integer IO format: %I64d Java class name: (Any)

There is a fence in front of Polycarpus's home. The fence consists of n planks of the same width which go one after another from left to right. The height of the i-th plank is hi meters, distinct planks can have distinct heights.

#include <bits/stdc++.h>
using namespace std;
const int maxn = 200010;
int n,k,sum[maxn];
int main(){
while(~scanf("%d %d",&n,&k)){
int theMin = INT_MAX,idx = -1;
for(int i = 1; i <= n; ++i){
scanf("%d",sum+i);
sum[i] += sum[i-1];
if(i >= k && sum[i] - sum[i-k] < theMin){
theMin = sum[i] - sum[i-k];
idx = i - k + 1;
}
}
printf("%d\n",idx);
}
return 0;
}

View Code