Submission #22,466

2026-01-15 08:59:52

cpp17

Wrong answer 34/40

74ms

1184 KiB

#include <iostream>
using namespace std;
int a[200001],n,k;
void be(){
cin>>n>>k;
for(int i=0;i<n;i++){
    cin>>a[i];
}
}
int fasor(){
int i=0,s,t;
while(i+s<n){s=1;t=1;
    while(s<=k && t==1){
        if(a[i]<a[i+s])t=0;
        s++;
    }
    if(t==1)return (i+1);
    i=i+s-1;
    }
    return -1;
}
int main()
{int b;
    be();
    b=fasor();
    cout<<b;
    return 0;
}

	Sum	Test	Verdict		Time	Memory
base	34/40
		1	Accepted	0/0	1ms	316 KiB
		2	Accepted	0/0	4ms	508 KiB
		3	Accepted	2/2	1ms	552 KiB
		4	Wrong answer	0/2	1ms	316 KiB
		5	Accepted	2/2	1ms	316 KiB
		6	Accepted	2/2	1ms	316 KiB
		7	Accepted	2/2	1ms	316 KiB
		8	Accepted	2/2	2ms	560 KiB
		9	Accepted	2/2	4ms	500 KiB
		10	Accepted	2/2	4ms	316 KiB
		11	Accepted	2/2	4ms	508 KiB
		12	Accepted	2/2	3ms	316 KiB
		13	Accepted	2/2	37ms	572 KiB
		14	Wrong answer	0/2	34ms	556 KiB
		15	Accepted	2/2	57ms	1112 KiB
		16	Accepted	2/2	67ms	1184 KiB
		17	Accepted	2/2	74ms	936 KiB
		18	Accepted	2/2	74ms	1136 KiB
		19	Accepted	2/2	72ms	984 KiB
		20	Wrong answer	0/2	21ms	564 KiB
		21	Accepted	2/2	59ms	1056 KiB
		22	Accepted	2/2	72ms	1076 KiB