fork download
  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 m){
  33.  
  34. vector<int> dp(n+1, 0);
  35.  
  36. dp[0] = 1;
  37. dp[1] = 1;
  38.  
  39. for(int i=2; i<=n; i++){
  40.  
  41. int j = i-1;
  42. int sum = a[i];
  43. while(j>=0 && sum <= m ){
  44. dp[i] += dp[j];
  45. sum += a[j];
  46. j--;
  47. }
  48. }
  49.  
  50. return dp[n];
  51. }
  52.  
  53.  
  54.  
  55.  
  56.  
  57.  
  58.  
  59.  
  60.  
  61.  
  62.  
  63.  
  64.  
  65.  
  66.  
  67. int practice(int n, int m){
  68.  
  69.  
  70. return 0;
  71. }
  72.  
  73.  
  74.  
  75.  
  76.  
  77. void solve() {
  78.  
  79. int n, m;
  80. cin >> n >> m;
  81.  
  82. a.resize(n+1);
  83. for(int i=1; i<=n; i++) cin >> a[i];
  84.  
  85. cout << consistency(n, m) << endl;
  86.  
  87.  
  88. }
  89.  
  90.  
  91.  
  92.  
  93.  
  94. int32_t main() {
  95. ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  96.  
  97. int t = 1;
  98. // cin >> t;
  99. while (t--) {
  100. solve();
  101. }
  102.  
  103. return 0;
  104. }
Success #stdin #stdout 0s 5320KB
stdin
5 5
1 2 3 4 4 
stdout
3