题解 | #牛牛的数组匹配#

#include <stdio.h>

int main() {
    int n, m, get_a, sum_a = 0;
    scanf("%d %d", &n, &m);
    int b[m];

    for (int i = 0; i < n; i++) {
        scanf("%d", &get_a);
        sum_a += get_a;
    }
	
    for (int i = 0; i < m; i++) {
        scanf("%d", &b[i]);
    }

    // 开始判断
    int b_l, b_r, same_val = sum_a;
    for (int i = 0; i < m; i++) {
        int sum = 0;
        for (int j = i; j < m; j++) {
            sum += b[j];
            int get = sum_a - sum;
            if (get < 0) get = -get;    // 负数变正数

            if (get < same_val) {
                b_l = i;
                b_r = j;
                same_val = get;
            }
        }
    }
    
    // 输出结果
    for (int i = b_l; i <= b_r; i++) printf("%d ", b[i]);


    return 0;
}