fork download
copy 
  1. /*
  2. * @Author: hungeazy
  3. * @Date:   2024-06-04 18:21:05
  4. * @Last Modified by:   hungeazy
  5. * @Last Modified time: 2024-06-04 18:33:34
  6. */
  7. #include <bits/stdc++.h>
  8. // #pragma GCC optimize("O3")  
  9. // #pragma GCC optimize("unroll-loops")  
  10. // #pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")  
  11. using namespace std;
  12. #define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
  13. #define int long long
  14. #define ull unsigned long long
  15. #define sz(x) x.size()
  16. #define sqr(x) (1LL * (x) * (x))
  17. #define all(x) x.begin(), x.end()
  18. #define fill(f,x) memset(f,x,sizeof(f))
  19. #define FOR(i,l,r) for(int i=l;i<=r;i++)
  20. #define FOD(i,r,l) for(int i=r;i>=l;i--)
  21. #define ii pair<int,int>
  22. #define iii pair<int,ii>
  23. #define di pair<ii,ii>
  24. #define vi vector<int>
  25. #define vii vector<ii>
  26. #define mii map<int,int>
  27. #define fi first
  28. #define se second
  29. #define pb push_back
  30. #define MOD 1000000007
  31. #define __lcm(a,b) (1ll * ((a) / __gcd((a), (b))) * (b))
  32. #define YES cout << "YES\n"
  33. #define NO cout << "NO\n"
  34. #define MASK(i) (1LL << (i))
  35. #define c_bit(i) __builtin_popcountll(i)
  36. #define BIT(x,i) ((x) & MASK(i))
  37. #define SET_ON(x,i) ((x) | MASK(i))
  38. #define SET_OFF(x,i) ((x) & ~MASK(i))
  39. #define oo 1e18
  40. #define name "bai3"
  41. #define endl '\n'
  42. #define time() cout << "-------------Time:" << 1000.0 * clock() / CLOCKS_PER_SEC << "ms.";
  43. template<typename T> bool maximize(T &res, const T &val) { if (res < val){ res = val; return true; }; return false; }
  44. template<typename T> bool minimize(T &res, const T &val) { if (res > val){ res = val; return true; }; return false; }
  45. const int N = (int)1e6+10;
  46. int a[N],pre[N],preEven[N];
  47.  
  48. signed main()
  49. {
  50.     fast;
  51.     freopen(name".inp","r",stdin);
  52.     freopen(name".out","w",stdout);
  53.     int n,k;
  54.     cin >> n >> k;
  55.     FOR(i,1,n) 
  56.     {
  57.     	cin >> a[i];
  58.     	pre[i] = pre[i-1]+a[i];
  59.     	preEven[i] = preEven[i-1]+(a[i]%2==0);
  60.     }
  61.     int ans = -oo, pos, cnt = -oo;
  62.     FOR(i,1,n-k+1)
  63.     	if (ans < pre[i+k-1]-pre[i-1]) 
  64.     	{
  65.     		ans = pre[i+k-1]-pre[i-1];
  66.     		pos = i;
  67.     		cnt = preEven[i+k-1]-preEven[i-1];
  68.     	}
  69.     	else if (ans == pre[i+k-1]-pre[i-1] and cnt < preEven[i+k-1]-preEven[i-1]) 
  70.     	{
  71.     		cnt = preEven[i+k-1]-preEven[i-1];   
  72.     		pos = i;
  73.     	}
  74.     cout << pos << " " << pos+k-1;
  75.     return 0;
  76. }
  77. // ██░ ██  █    ██  ███▄    █   ▄████
  78. //▓██░ ██▒ ██  ▓██▒ ██ ▀█   █  ██▒ ▀█▒
  79. //▒██▀▀██░▓██  ▒██░▓██  ▀█ ██▒▒██░▄▄▄░
  80. //░▓█ ░██ ▓▓█  ░██░▓██▒  ▐▌██▒░▓█  ██▓
  81. //░▓█▒░██▓▒▒█████▓ ▒██░   ▓██░░▒▓███▀▒
  82. // ▒ ░░▒░▒░▒▓▒ ▒ ▒ ░ ▒░   ▒ ▒  ░▒   ▒
  83. // ▒ ░▒░ ░░░▒░ ░ ░ ░ ░░   ░ ▒░  ░   ░
  84. // ░  ░░ ░ ░░░ ░ ░    ░   ░ ░ ░ ░   ░
  85. // ░  ░  ░   ░              ░       ░
Success #stdin #stdout 0s 5320KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Standard output is empty
https://ideone.com/H4Y8J0
language:
C++14 (gcc 8.3)
created:
6 hours ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!