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