Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- int main() {
- int n, m;
- cin >> n >> m;
- int a[100005];
- int s = 0;
- for(int i = 0; i < n; i++) {
- cin >> a[i];
- }
- int j = 0, ret = 0;
- for(int i = 0; i < n; i++) {
- while(j < n and s + a[j] <= m) {
- ret = max(ret, j - i + 1);
- s += a[j];
- j++;
- }
- s -= a[i];
- }
- cout << ret << endl;
- return 0;
- }
- // 1 2 3 4 5
- // a --> b imame tocno b - a + 1
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement