Guest User

Untitled

a guest
Feb 19th, 2018
86
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.52 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define ll long long
  4.  
  5. ll a[100005];
  6. int main()
  7. {
  8. ll n,k;
  9. scanf("%lld %lld",&n,&k);
  10. for(int i=1;i<=n;i++)
  11. {
  12. scanf("%lld",&a[i]);
  13. int p=0;
  14. while(a[i]>1)a[i]/=2,p++;
  15. a[i]=p;
  16. }
  17. ll mx=-1,idx=1;
  18. for(int i=1;i<=n-k+1;i++)
  19. {
  20. ll sum=1;
  21. for(int j=1,pos=i;j<=k;j++,pos++)
  22. sum+=a[pos];
  23. if(sum>mx)
  24. {
  25. mx=sum;
  26. idx=i;
  27. }
  28. }
  29. cout<<idx<<endl;
  30. return 0;
  31. }
Add Comment
Please, Sign In to add comment