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. // 2
  28. // 6
  29. // 1 8 10 8 -5 8
  30. // 9
  31. // 2 8 -20 8 10 -4 2 8 10
  32.  
  33.  
  34.  
  35.  
  36.  
  37. vector<int> a;
  38.  
  39. int consistency(int n){
  40.  
  41.  
  42. 	int sum = 0;
  43. 	int lastSum = 0;
  44.  
  45. 	unordered_map<int,int> mp;
  46.  
  47. 	int ans = -INF;
  48.  
  49. 	for(int i=0; i<n; i++){
  50. 		sum += a[i];
  51. 		if(i-1>=0) lastSum += a[i-1];
  52.  
  53. 		if(mp.count(a[i])){
  54. 			ans = max(ans, sum - mp[a[i]]);
  55.  
  56. 			mp[a[i]] = min(mp[a[i]], lastSum);
  57. 		}
  58. 		else {
  59. 			mp[a[i]] = lastSum;
  60. 		}
  61.  
  62. 	}
  63.  
  64.     return ans;
  65. }
  66.  
  67.  
  68.  
  69.  
  70.  
  71.  
  72.  
  73.  
  74.  
  75.  
  76.  
  77.  
  78.  
  79.  
  80.  
  81. int practice(int n){
  82.  
  83.  
  84. }
  85.  
  86.  
  87.  
  88.  
  89.  
  90. void solve() {
  91.  
  92.     int n;
  93.     cin>> n;
  94.  
  95.     a.resize(n);
  96.     for(int i=0; i<n; i++) cin >> a[i];
  97.  
  98.     cout << consistency(n) << endl;
  99.  
  100.     // cout << consistency(n) << " " << practice(n) << endl;
  101.  
  102.  
  103. }
  104.  
  105.  
  106.  
  107.  
  108.  
  109. int32_t main() {
  110.     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  111.  
  112.     int t = 1;
  113.     cin >> t;
  114.     while (t--) {
  115.         solve();
  116.     }
  117.  
  118.     return 0;
  119. }
Success #stdin #stdout 0s 5316KB
comments (?)
stdin
copy 
2
6
1 8 10 8 -5 8
9
2 8 -20 8 10 -4 2 8 10
stdout
copy 
29
26
https://ideone.com/HqtAKX
language:
C++14 (gcc 8.3)
created:
12 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!