fork download
  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 consistency1(int n, int k) {
  27.  
  28. int s= 0, e = n-1;
  29. int ans = 0;
  30.  
  31. //* keep in mind s<e (Not s<=e )
  32. while(s<e){
  33. int sum = a[s] + a[e];
  34. if(sum > k){
  35. ans += (e-s);
  36. e--;
  37. }
  38. else{
  39. s++;
  40. }
  41. }
  42.  
  43. cout << ans << " ";
  44.  
  45. }
  46.  
  47.  
  48. //* Template 2
  49. //* Shrink Invlaid window
  50. //* Invalid window => sum <= k
  51. //* Valid window => sum > k
  52.  
  53. void consistency2(int n, int k) {
  54.  
  55. int s= 0, e = n-1;
  56. int ans = 0;
  57.  
  58.  
  59. while(e>=0){
  60. int sum = a[s] + a[e];
  61.  
  62. while(s<e && sum <= k){
  63. s++;
  64. sum = a[s] + a[e];
  65. }
  66. if(s==e) break;
  67.  
  68. ans += (e-s);
  69. e--;
  70. }
  71.  
  72. cout << ans << " ";
  73.  
  74. }
  75.  
  76.  
  77.  
  78. void solve() {
  79.  
  80. int n, k;
  81. cin >> n >> k;
  82.  
  83. a.resize(n);
  84.  
  85. for(int i=0; i<n; i++) cin >> a[i];
  86.  
  87. consistency1(n, k);
  88. consistency2(n, k);
  89. cout << endl;
  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 5276KB
stdin
5 8
1 2 7 9 10 
stdout
8 8