双倍 经验 失败
| 编号 | #1 | #2 |
|---|---|---|
| 代码 | 代码1 | 代码2 |
| 算法 | 强行遍历 | 贪心 |
| 时间复杂度 | O(n2) ! | O(n) ✔ |
| Errors | #4 TLE,#5 TLE | #2 WA,#3 WA |
| 成绩 | 76 | 76(Draw!) |
代码1
#include <iostream>
#include <deque>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int a[n] = {0};
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int max = -1;
while (k) {
int sum = 0;
for (int i = 0; i < k; i++) {
sum += a[i];
}
if (max < sum) max = sum;
for (int i = k; i < n; i++) {
sum += a[i];
sum -= a[i - k];
if (max < sum) max = sum;
}
k--;
}
cout << max;
return 0;
}
代码2
#include <iostream>
#include <deque>
using namespace std;
deque < int > q;
int main() {
int n, m;
cin >> n >> m;
int sum = 0, max = 0;
int len = 0;
int val;
for (int i = 1; i <= n; i++) {
cin >> val;
sum += val;
q.push_back(val);
len++;
if (len > m) {
len--;
sum -= q.front();
q.pop_front();
}
if (sum > max) max = sum;
if (sum < 0) {
q.clear();
sum = 0;
len = 0;
}
}
cout << max;
return 0;
}
QwQ lol
troll P:) 69420