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