Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- #define ll long long
- ll a[100005];
- int main()
- {
- ll n,k;
- scanf("%lld %lld",&n,&k);
- for(int i=1;i<=n;i++)
- {
- scanf("%lld",&a[i]);
- int p=0;
- while(a[i]>1)a[i]/=2,p++;
- a[i]=p;
- }
- ll mx=-1,idx=1;
- for(int i=1;i<=n-k+1;i++)
- {
- ll sum=1;
- for(int j=1,pos=i;j<=k;j++,pos++)
- sum+=a[pos];
- if(sum>mx)
- {
- mx=sum;
- idx=i;
- }
- }
- cout<<idx<<endl;
- return 0;
- }
Add Comment
Please, Sign In to add comment