类似与省赛中的统计子矩阵,只不过这套题是一维的
当矩阵被分成若干个子矩阵内部求和的时候类似于一维数组中求和小于k的子数组
暴力求解:(时间复杂度o(n2))
* //暴力解法求一维数组中子数组和不超过k的子数组的个数
#include<iostream>
using namespace std;
int n, sum, cnt;
int k=7;
int num[100];
int main(){
cin >> n;
for (int i = 0; i < n; i++)
{
cin >> num[i];
}
for (int i=0; i < n; i++) {
sum = 0;
for (int j = i;j< n; j++) {
sum = sum + num[j];
if (sum <= k) {
cout << "sum:" << sum;
cnt++;
cout << "cnt:" << cnt << endl;
}
}
}
//cout << cnt << endl;
return 0;
}
滑动窗口优化:时间复杂度(o(n))
第一种思路:
#include<iostream>
using namespace std;
int num[100];
int n, k=7, sum, cnt;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> num[i];
}
int i = 0;
for (int j = 0; j < n; j++) {//表示终点
sum = sum + num[j];
while (sum > k) {
cout << "sum:" << sum;
sum -= num[i];
i++;
}
cnt += j - i+1;//表示i到j的长度为 1 ~ j- i + 1的子矩阵个数
cout << "cnt:" << cnt;
}
return 0;
}
第二种思路:
#include<iostream>
using namespace std;
int const N = 1e5 + 10;
int a[N];
int left, right, ans, k;
int sum[N];
int main() {
int n;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
sum[i] = sum[i - 1] + a[i];
}
for (int left = 1, right = 1; right <= n; right++) {
while (left <= right && sum[right] - sum[left - 1] > k) {
left++;
}
ans = ans + right - left + 1;
}
cout << ans << endl;
return 0;
}