fork download
copy 
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define int              long long int
  4. #define double           long double
  5. #define print(a)         for(auto x : a) cout << x << " "; cout << endl
  6.  
  7.  
  8. const int M = 1000000007;
  9. const int N = 3e5+9;
  10. const int INF = 2e9+1;
  11. const int LINF = 2000000000000000001;
  12.  
  13. inline int power(int a, int b, int mod=M) {
  14.     int x = 1;
  15.     a %= mod;
  16.     while (b) {
  17.         if (b & 1) x = (x * a) % mod; 
  18.         a = (a * a) % mod;
  19.         b >>= 1;
  20.     }
  21.     return x;
  22. }
  23.  
  24.  
  25. //_ ***************************** START Below *******************************
  26.  
  27. // 6 4
  28. // -3 4 3 -5 2 4
  29.  
  30.  
  31. vector<int> a;
  32.  
  33.  
  34. // Sorted  Set 
  35.  
  36. int consistency1(int n, int k){
  37.  
  38. 	set<pair<int,int>> st;
  39. 	vector<int> prefix(n+1, 0);
  40.  
  41. 	int ans = 0;
  42.  
  43. 	for(int i=1; i<=n; i++){
  44. 		prefix[i] = prefix[i-1] + a[i-1];
  45.  
  46. 		st.insert({prefix[i-1], i-1});
  47.  
  48. 		if(!st.empty() && i-k-1 >=0 ) st.erase({prefix[i-k-1], i-k-1});
  49.  
  50.  
  51. 		auto mini = (*st.begin()).first;
  52. 		int val = prefix[i] - mini;
  53.  
  54. 		ans = max(ans, val);
  55. 	}
  56.  
  57. 	return ans;
  58. }
  59.  
  60.  
  61.  
  62.  
  63. // Sorted Multi Set 
  64.  
  65. int consistency2(int n, int k){
  66.  
  67. 	multiset<int> st;
  68. 	vector<int> prefix(n+1, 0);
  69.  
  70. 	int ans = 0;
  71.  
  72. 	for(int i=1; i<=n; i++){
  73. 		prefix[i] = prefix[i-1] + a[i-1];
  74.  
  75. 		st.insert(prefix[i-1]);
  76.  
  77. 		if(!st.empty() && i-k-1 >=0 ) st.erase(st.find(prefix[i-k-1]));
  78.  
  79.  
  80. 		auto mini = *st.begin();
  81. 		int val = prefix[i] - mini;
  82.  
  83. 		ans = max(ans, val);
  84. 	}
  85.  
  86. 	return ans;
  87.  
  88. }
  89.  
  90.  
  91.  
  92.  
  93.  
  94. // deque 
  95.  
  96. int consistency3(int n, int k){
  97.  
  98. 	deque<int> up;
  99. 	vector<int> prefix(n+1, 0);
  100.  
  101. 	int ans = 0;
  102.  
  103. 	for(int i=1; i<=n; i++){
  104. 		prefix[i] = prefix[i-1] + a[i-1];
  105.  
  106. 		while(!up.empty() && prefix[i-1] < prefix[up.back()]  ) up.pop_back();
  107. 		up.push_back(i-1);
  108.  
  109. 		if(!up.empty() && i-k-1 == up.front()) up.pop_front();
  110.  
  111.  
  112. 		auto mini = prefix[up.front()];
  113. 		int val = prefix[i] - mini;
  114.  
  115. 		ans = max(ans, val);
  116. 	}
  117.  
  118. 	return ans;
  119. }
  120.  
  121.  
  122.  
  123.  
  124.  
  125.  
  126.  
  127.  
  128.  
  129.  
  130.  
  131.  
  132.  
  133.  
  134.  
  135. int practice(int n, int k){
  136.  
  137.  
  138.     return 0;
  139. }
  140.  
  141.  
  142.  
  143.  
  144.  
  145. void solve() {
  146.  
  147.     int n, k;
  148.     cin>> n >> k;
  149.  
  150.     a.resize(n);
  151.     for(int i=0; i<n; i++) cin >> a[i];
  152.  
  153.     cout << consistency1(n, k) << " " << consistency2(n, k) <<  " " << consistency3(n, k) << endl;
  154.  
  155.  
  156. }
  157.  
  158.  
  159.  
  160.  
  161.  
  162. int32_t main() {
  163.     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  164.  
  165.     int t = 1;
  166.     // cin >> t;
  167.     while (t--) {
  168.         solve();
  169.     }
  170.  
  171.     return 0;
  172. }
Success #stdin #stdout 0s 5320KB
comments (?)
stdin
copy 
6 4
-3 4 3 -5 2 4
stdout
copy 
7 7 7
https://ideone.com/Gvnr3R
language:
C++14 (gcc 8.3)
created:
3 days 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!