数组-3—算法—6-9-练习(P1614，P2911)

P1614
/**
 * ClassName: ${NAME}
 * package: ${PACKAGE_NAME}
 * Description:
 * @Author: innno
 * @Create: 2024/2/27 - 21:54
 * @Version: v1.0
 */
#include <bits/stdc++.h>

using namespace std;
using ll = long long;
const ll MAX = 1e10;

int main()
    {
        ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
        int n, m;
        cin >> n >> m;
        vector<ll> num(n);
        if (n == 0 && m == 0)
            {
                cout << '0';
                return 0;
            }
        for (auto &_num: num)
            {
                cin >> _num;
            }

        ll min = MAX;
        for (ll i = 0; i <= n - m; i++)
            {
                ll _min = num[i];
                for (int j = 1; j < m; j++)
                    {
                        _min += num[i + j];
                    }
                if (_min <= min)
                    {
                        swap(_min, min);
                    }
            }
        cout << min;
        return 0;
    }

P2911
/**
 * ClassName: ${NAME}
 * package: ${PACKAGE_NAME}
 * Description:
 * @Author: innno
 * @Create: 2024/2/27 - 21:54
 * @Version: v1.0
 */
#include <bits/stdc++.h>

using namespace std;
using ll = long long;
ll num[100];

int main()
    {
        ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
        ll s1, s2, s3;
        cin >> s1 >> s2 >> s3;
        for (ll i = 1; i <= s1; i++)
            {
                for (ll j = 1; j <= s2; j++)
                    {
                        for (ll k = 1; k <= s3; k++)
                            {
                                num[i + j + k]++;
                            }
                    }
            }
        ll min_ = 0;
        ll _min;
        for (ll i = 3; i < 100; i++)
            {
                if(min_<num[i])
                    {
                        swap(min_,num[i]);
                        _min=i;
                    }
            }
        cout << _min;
        return 0;
    }