QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#644170 | #8781. Element-Wise Comparison | zhao_daodao | TL | 0ms | 3680kb | C++14 | 601b | 2024-10-16 11:30:38 | 2024-10-16 11:30:38 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
const int MAXN=5e4+5;
uint16_t n,m,a[MAXN];
uint16_t can[MAXN],ans[MAXN];
inline void check(uint16_t i,uint16_t mx){
for(uint16_t len=1;len<=mx;len++){
bool ok=a[i]<a[i+len];
can[len]=(can[len]+1)*ok;
ans[len]+=(can[len]>=m);
}
}
signed main(){
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
cin>>n>>m;
for(uint16_t i=1;i<=n;i++)cin>>a[i];
for(uint16_t i=1;i<=n;i++)check(i,min(n-m,n-i+1));
int res=0;
for(uint16_t i=1;i<=n;i++)res+=ans[i];
cout<<res<<"\n";
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3628kb
input:
5 3 5 2 1 3 4
output:
0
result:
ok answer is '0'
Test #2:
score: 0
Accepted
time: 0ms
memory: 3680kb
input:
5 2 3 1 4 2 5
output:
2
result:
ok answer is '2'
Test #3:
score: 0
Accepted
time: 0ms
memory: 3660kb
input:
4 2 1 2 3 4
output:
3
result:
ok answer is '3'
Test #4:
score: 0
Accepted
time: 0ms
memory: 3680kb
input:
4 2 4 3 2 1
output:
0
result:
ok answer is '0'
Test #5:
score: 0
Accepted
time: 0ms
memory: 3588kb
input:
1 1 1
output:
0
result:
ok answer is '0'
Test #6:
score: -100
Time Limit Exceeded
input:
50000 2 44045 29783 5389 7756 44022 45140 21967 5478 10868 49226 21775 31669 49836 13511 46116 14229 27206 31168 37389 3158 10658 41154 14635 18526 40540 6451 23197 46719 30593 13517 8604 46666 39189 43746 12778 3684 3194 36979 43020 14652 19549 31178 17144 27177 44336 2849 40220 11751 41993 32209 4...