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

#include <stdio.h>
#include <math.h>
int main() {
    int a, b, sum = 0, sum_b = 0, pos1 = 0, pos2 = 0;
    int arr[100] = {0}, brr[100] = {0};
    scanf("%d %d", &a, &b);
    //getchar();
    for (int i = 0; i < a; i++) {
        scanf("%d", &arr[i]);
        sum += arr[i];
    }
    for (int i = 0; i < b; i++)
        scanf("%d", &brr[i]);
    for (int i = 0; i < b; i++) {
        int sum_a = 0;
        for (int j = i; j < b; j++) {
            sum_a += brr[j];
            if (abs(sum_a - sum) < abs(sum_b - sum)) {
                sum_b = sum_a;
                pos1 = i;
                pos2 = j;
            }
        }
    }
    for (int i = pos1; i <= pos2; i++) printf("%d ", brr[i]);
    return 0;
}