2806 | 2023. 01. 26 10:18:01 | gkata | Fasor (40) | cpp17 | Runtime error 38/40 | 76ms | 7644 KiB |
#include <iostream>
//#include <fstream>
#include <vector>
#include <climits>
#define ll long long
using namespace std;
//ifstream cin("fasor.in");
//ofstream cout("fasor.out");
vector <ll>x;
ll n,k,i,j,a,maxi=LONG_MIN,maxi2=LONG_MIN,pos,pos2;
int main()
{
cin>>n>>k;
for(i=1;i<=n;++i)
{
cin>>a;
x.push_back(a);
}
for(i=0;i<=k;++i)
if(x[i]>maxi)
{
maxi=x[i];
pos=i;
}
if(maxi==x[n-1]) cout<<pos+1;
else
{
if((pos+k)<n)
{
for(i=(pos+1);i<=(pos+k);++i)
if(x[i]>maxi2)
{
maxi2=x[i];
pos2=i;
}
}
else
{
for(i=(pos+1);i<n;++i)
if(x[i]>maxi2)
{
maxi2=x[i];
pos2=i;
}
}
if(maxi>=maxi2) cout<<pos+1;
else
{
while(maxi<maxi2)
{
pos=pos2;
maxi=maxi2;
if((pos+k)<n)
{
for(i=(pos+1);i<=(pos+k);++i)
if(x[i]>maxi2)
{
maxi2=x[i];
pos2=i;
}
}
else
{
for(i=(pos+1);i<n;++i)
if(x[i]>maxi2)
{
maxi2=x[i];
pos2=i;
}
}
}
cout<<pos+1;
}
}
return 0;
}
Subtask | Sum | Test | Verdict | Time | Memory | ||
---|---|---|---|---|---|---|---|
base | 38/40 | ||||||
1 | Accepted | 0/0 | 3ms | 1872 KiB | |||
2 | Accepted | 0/0 | 4ms | 2544 KiB | |||
3 | Accepted | 2/2 | 2ms | 2328 KiB | |||
4 | Accepted | 2/2 | 2ms | 2400 KiB | |||
5 | Accepted | 2/2 | 2ms | 2376 KiB | |||
6 | Accepted | 2/2 | 2ms | 2720 KiB | |||
7 | Accepted | 2/2 | 2ms | 2660 KiB | |||
8 | Accepted | 2/2 | 3ms | 2692 KiB | |||
9 | Accepted | 2/2 | 4ms | 3164 KiB | |||
10 | Accepted | 2/2 | 6ms | 3180 KiB | |||
11 | Accepted | 2/2 | 6ms | 3184 KiB | |||
12 | Accepted | 2/2 | 4ms | 3184 KiB | |||
13 | Accepted | 2/2 | 37ms | 5060 KiB | |||
14 | Runtime error | 0/2 | 35ms | 5120 KiB | |||
15 | Accepted | 2/2 | 59ms | 7188 KiB | |||
16 | Accepted | 2/2 | 67ms | 7228 KiB | |||
17 | Accepted | 2/2 | 76ms | 7160 KiB | |||
18 | Accepted | 2/2 | 74ms | 7352 KiB | |||
19 | Accepted | 2/2 | 74ms | 7364 KiB | |||
20 | Accepted | 2/2 | 23ms | 5476 KiB | |||
21 | Accepted | 2/2 | 61ms | 7556 KiB | |||
22 | Accepted | 2/2 | 72ms | 7644 KiB |