Submission #11,445

2024-09-26 07:34:35

cpp14

Wrong answer 34/40

74ms

1296 KiB

#include <iostream>

using namespace std;

int main()
{
    int v[200002]={0};
    int cmax=0, maxi=0;
    int n,k, temp1;
    bool a=0;
    cin>>n>>k;
    v[0]=-1;
    v[n+1]=-1;
    for(int i=1;i<=n;i++){
        cin>>v[i];
    }
    for(int i=1;i<=n;i++){
        if(cmax<v[i]){
            cmax=v[i];
            maxi=i;
            a=1;
        }
        if((i-k)>0) if(v[i-k]==cmax){
            cout<<maxi;
            break;
        }
    }
    if(a==0){
        cout<<maxi;
    }
    return 0;
}

	Sum	Test	Verdict		Time	Memory
base	34/40
		1	Accepted	0/0	3ms	1128 KiB
		2	Accepted	0/0	6ms	1128 KiB
		3	Accepted	2/2	3ms	1168 KiB
		4	Wrong answer	0/2	3ms	1136 KiB
		5	Accepted	2/2	3ms	1296 KiB
		6	Accepted	2/2	3ms	1144 KiB
		7	Accepted	2/2	3ms	1128 KiB
		8	Accepted	2/2	4ms	1144 KiB
		9	Accepted	2/2	6ms	1148 KiB
		10	Accepted	2/2	7ms	1144 KiB
		11	Accepted	2/2	7ms	1128 KiB
		12	Accepted	2/2	4ms	1272 KiB
		13	Accepted	2/2	39ms	1180 KiB
		14	Wrong answer	0/2	35ms	1144 KiB
		15	Accepted	2/2	59ms	1268 KiB
		16	Accepted	2/2	67ms	1144 KiB
		17	Accepted	2/2	74ms	1144 KiB
		18	Accepted	2/2	74ms	1052 KiB
		19	Accepted	2/2	72ms	1272 KiB
		20	Wrong answer	0/2	23ms	1000 KiB
		21	Accepted	2/2	59ms	1128 KiB
		22	Accepted	2/2	74ms	1164 KiB