AcWing 102. 最佳牛围栏
原题链接
简单
作者:
XMLife
,
2024-03-04 21:02:13
,
所有人可见
,
阅读 19
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
int main() {
int N, F;
cin >> N >> F;
vector<int> cows(N);
for (int i = 0; i < N; ++i) {
cin >> cows[i];
}
double maxAvg = 0;
for (int start = 0; start < N - F + 1; ++start) {
int sum = 0;
for (int end = start; end < N; ++end) {
sum += cows[end];
if (end - start + 1 >= F) {
double avg = (double)sum / (end - start + 1);
maxAvg = max(maxAvg, avg);
}
}
}
int maxAvgInt = (int)(maxAvg * 1000);
cout << maxAvgInt << endl;
return 0;
}