#include<bits/stdc++.h>
using namespace std ;
const int N = 1e5 + 7 ;
int n , k ;
long long a[N] ;
int main(){
ios_base::sync_with_stdio(0) ;
cin.tie(0) ;
cin>>n ;
for(int i = 0 ;i < n ;i++){
cin>>a[i] ;
}
cin>>k ;
long long ans = 0 ;
for(int i =0 ;i < n ;i++){
long long sum = 0 ;
for(int j = i ;j < n ;j++){
sum+=a[j] ;
if( sum >= k * (j - i +1) ){
ans++ ;
}
}
}
cout<<ans ;
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
57 ms |
384 KB |
Output is correct |
2 |
Correct |
36 ms |
504 KB |
Output is correct |
3 |
Correct |
32 ms |
384 KB |
Output is correct |
4 |
Incorrect |
19 ms |
2304 KB |
Output isn't correct |
5 |
Incorrect |
19 ms |
2304 KB |
Output isn't correct |
6 |
Incorrect |
19 ms |
2304 KB |
Output isn't correct |
7 |
Incorrect |
18 ms |
2432 KB |
Output isn't correct |
8 |
Incorrect |
18 ms |
2304 KB |
Output isn't correct |
9 |
Incorrect |
20 ms |
2304 KB |
Output isn't correct |
10 |
Incorrect |
19 ms |
2304 KB |
Output isn't correct |