fork download
copy 
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define int              long long int
  4. #define double           long double
  5.  
  6.  
  7. const int M = 1000000007;
  8. const int N = 3e5+9;
  9. const int INF = 2e9+1;
  10. const int MAXN = 100000;
  11. const int LINF = 2000000000000000001;
  12.  
  13. //_ ***************************** START Below *******************************
  14.  
  15.  
  16.  
  17. vector<int> a;
  18.  
  19. int consistency(int n ){
  20.  
  21. 	int sum = 0, ans = 0;
  22. 	unordered_map<int,int> mp;
  23.  
  24. 	int s = 0, e = 0;
  25. 	while(e<n){
  26. 		mp[a[e]]++;
  27. 		sum += a[e];
  28.  
  29. 		if(mp.size() == e-s+1){
  30. 			ans = max(ans, sum);
  31. 			e++;
  32. 		}
  33. 		else{
  34. 			while(s<=e && mp.size() < e-s+1){
  35. 				mp[a[s]]--;
  36. 				if(mp[a[s]] == 0) mp.erase(a[s]);
  37. 				sum -= a[s];
  38. 				s++;
  39. 			}
  40. 			ans = max(ans, sum);
  41. 			e++;
  42. 		}
  43. 	}
  44.  
  45. 	return ans;
  46.  
  47. }
  48.  
  49.  
  50.  
  51.  
  52.  
  53.  
  54.  
  55.  
  56.  
  57. int practice(int n){
  58.  
  59. 	return 0;	
  60. }
  61.  
  62.  
  63.  
  64.  
  65. void solve() {
  66.  
  67. 	int n;
  68. 	cin >> n;
  69. 	a.resize(n);
  70. 	for(int i=0; i<n; i++) cin >> a[i];
  71.  
  72. 	cout << consistency(n) << endl;
  73. 	// cout << consistency(n) << " -> " << practice(n) << endl;
  74.  
  75. }
  76.  
  77.  
  78.  
  79.  
  80.  
  81. int32_t main() {
  82.     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  83.  
  84.     int t = 1;
  85.     while (t--) {
  86.         solve();
  87.     }
  88.  
  89.     return 0;
  90. }
Success #stdin #stdout 0s 5324KB
comments (?)
stdin
copy 
5
4 2 4 5 6
stdout
copy 
17
https://ideone.com/dlGjWU
language:
C++14 (gcc 8.3)
created:
20 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!