#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define int long long
#define all(pr1) pr1.begin(),pr1.end()
#define alr(pr1) pr1.rbegin(),pr1.rend()
#define CEIL(pr1, pr2) (pr1 + pr2 - 1) / pr2
#define IOS std::ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define sz(s) (long long)(s.size())
const long long N = 45 + 9, M = 1e9 + 9, MOD = 1e9 + 7, OO = 0x3f3f3f3f, MAX = 2147483647, LOO = 0x3f3f3f3f3f3f3f3f;
int32_t main()
{
IOS;
int n, k;
cin >> n;
vector<int> a(n), pre(n + 1);
pre[0] = 0;
for (int i = 0; i < n; i++)
{
cin >> a[i];
pre[i + 1] = pre[i] + a[i];
}
cin >> k;
int ans = 0;
for (int i = 0; i < n; i++)
{
for (int j = i; j < n; j++)
{
int x = (pre[j + 1] - pre[i]) / (j - i + 1);
if (x >= k)
ans++;
}
}
cout << ans << "\n";
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
206 ms |
468 KB |
Output is correct |
2 |
Correct |
114 ms |
420 KB |
Output is correct |
3 |
Correct |
108 ms |
420 KB |
Output is correct |
4 |
Execution timed out |
1043 ms |
24652 KB |
Time limit exceeded |
5 |
Execution timed out |
1061 ms |
14104 KB |
Time limit exceeded |
6 |
Execution timed out |
1053 ms |
21880 KB |
Time limit exceeded |
7 |
Execution timed out |
1052 ms |
22812 KB |
Time limit exceeded |
8 |
Execution timed out |
1079 ms |
19812 KB |
Time limit exceeded |
9 |
Execution timed out |
1077 ms |
25536 KB |
Time limit exceeded |
10 |
Execution timed out |
1068 ms |
22196 KB |
Time limit exceeded |