完善程序（1）：两序列最大乘积

#include <algorithm>
#include <utility>

std::pair<int, int> find(int n, int a[])
{
    _____(1)_____;
    for (int i = 1; i < n; ++i)
    {
        _____(2)_____;
        mn = std::min(mn, a[i]);
    }
    _____(3)_____;
}

int solve(int n, int a[], int m, int b[])
{
    auto [maxa, mina] = _____(4)_____;
    auto [maxb, minb] = find(m, b);
    return _____(5)_____;
}

（1）处应填（ ）。

{{ select(1) }}

• int mx = 0, mn = 0;
• int mx = a[0], mn = 0;
• int mx = a[0], mn = a[0];
• int mx = 10000, mn = -10000;