寻找最接近子数组和的算法设计及其C++实现

#include <iostream>
#include <vector>
#include <climits>
using namespace std;
pair<int, int> findClosestSubarray(vector<int>& a, vector<int>& b) {
    pair<int, int> result;  // 存储结果的起始和结束索引
    int closest_sum = INT_MAX;  // 初始化最接近的和为最大整数
    for (int start = 0; start < b.size(); ++start) {
        int current_sum = 0;
        for (int end = start; end < b.size(); ++end) {
            current_sum += b[end];  // 计算当前子数组的和
            for (int i = 0; i < a.size(); ++i) {
                if (abs(current_sum - a[i]) < abs(closest_sum - a[i])) {
                    closest_sum = current_sum;  // 更新最接近的和
                    result = {start, end};  // 更新结果索引
                }
            }
        }
    }
    return result;
}
int main() {
    vector<int> a = {30, 39};
    vector<int> b = {15, 29, 42, 1, 44, 1};
    pair<int, int> result = findClosestSubarray(a, b);
    for (int i = result.first; i <= result.second; ++i) {
        cout << b[i] << " ";
    }
    cout << endl;
    return 0;
}