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