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.  
  28.  
  29.  
  30. vector<int> a;
  31.  
  32. int consistency(int n, int k){
  33.  
  34. 	unordered_map<int,int> mp;
  35. 	int len = INF;
  36. 	for(int i=0; i<n; i++){
  37. 		if(mp.count(k-a[i])){
  38. 			len = min(len, i - mp[k-a[i]] + 1);
  39. 		}
  40. 		mp[a[i]] = i;
  41. 	}
  42. 	return len;
  43. }
  44.  
  45.  
  46.  
  47. int followup(int n, int k){
  48.  
  49. 	unordered_map<int,int> mp;
  50. 	int len = 0;
  51. 	for(int i=0; i<n; i++){
  52. 		if(mp.count(k-a[i])){
  53. 			len = max(len, i - mp[k-a[i]] + 1);
  54. 		}
  55. 		else mp[a[i]] = i;
  56. 	}
  57. 	return len;
  58. }
  59.  
  60.  
  61.  
  62.  
  63.  
  64.  
  65.  
  66.  
  67.  
  68.  
  69.  
  70.  
  71.  
  72.  
  73.  
  74.  
  75.  
  76.  
  77.  
  78.  
  79.  
  80.  
  81.  
  82. int practice(int n, int k){
  83.  
  84.  
  85.     return 0;
  86. }
  87.  
  88.  
  89.  
  90.  
  91.  
  92. void solve() {
  93.  
  94.     int n, k;
  95.     cin>> n >> k;
  96.  
  97.     a.resize(n);
  98.     for(int i=0; i<n; i++) cin >> a[i];
  99.  
  100.     cout << consistency(n, k) << " " << followup(n, k) << 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 
10 8
5 6 7 8 10 4 3 2 1 3
stdout
copy 
7 10
https://ideone.com/4zBOTO
language:
C++14 (gcc 8.3)
created:
15 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!