1、子序列枚举问题(一维数组、字符串)
(1)求和问题
(2)长度问题
2、例题解析:#10039. 子序列和
int a[10000];
int main() {
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = 1; i <= n; i++) {
int s = 0;
for (int j = i; j <= n; j++) { //若需前后比较,则可令s = a[i]; j = i + 1
s = s + a[j];
if (s > k)
break;
if (s == k) {
cout << "yes";
return 0;
}
}
}
cout << "no";
return 0;
}