题意(Books):
给出序列及数k, 求序列从 i th 开始直到 n th 总和 <= k 的最大个数。
思路:
由于是连续的子串可先求出序列的后缀和数组, 从 n th开始用双指针维护一个总和小于k的子。
代码:
#include<bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define PII pair<int, int>
#define PLL pair<long, long>
typedef long long ll;
const int N = 1e5 + 7;
#define lowbit(x) (x & (-x))
ll rs(ll p) {return p << 1 | 1;}
ll ls(ll p) {return p << 1;}
const ll INF = 0x3f3f3f3f3f3f3f3f;
const int inf = 0x3f3f3f3f;
int a[N];
int main() {
int n, m; cin >> n >> m;
for (int i = 1; i <= n; i++) cin >> a[i];
for (int i = n - 1; i >= 1; i--) {
a[i] += a[i + 1];
}
int ans = 0;
int l = n, r = n;
while (l >= 1) {
if (a[l] - a[r + 1] <= m) {
ans = max(ans, r - l + 1);
l--;
}
else {
r--;
}
if (r < l) l--;
}
cout << ans;
return 0;
}