#include <bits/stdc++.h>
using namespace std;
#define int long long

const int INF = 0x3f3f3f3f;
const int N = 4e5 + 10;
int n, k;
int s[N];
int nxt[20][N];
int S(int l, int r) { return l > r ? 0ll : s[r] - s[l - 1]; }
int check(int mid) {
    memset(nxt, 0x3f, sizeof(nxt));
    int l = 1, r = 0;
    while (l <= 2 * n)
    {
        if (r < l)
            r = l;
        while (r + 1 <= 2 * n && S(l, r) < mid)
            r++;
        if (S(l, r) >= mid)
            nxt[0][l] = r + 1;
        l++;
    }
    // if (mid > 20)
    //     return 0;
    // cout << mid << endl;
    // for (int i = 1; i <= 2 * n; i++)
    //     cout << nxt[0][i] << " ";
    // cout << endl;
    for (int j = 1; j < 20; j++)
        for (int i = 1; i <= 2 * n; i++)
            nxt[j][i] = nxt[j - 1][i] == INF ? INF : nxt[j - 1][nxt[j - 1][i]];
    int ret = 0;
    for (int i = 1; i <= n; i ++ ) {
        int cnt = 0;
        int p = i;
        for (int j = 19; j >= 0; j--)
        {
            if (nxt[j][p] <= i + n)
                p = nxt[j][p], cnt |= 1 << j;
        }
        if (cnt >= k)
            ret++;
    }
    return ret;
}
signed main() {
    cin >> n >> k;
    for (int i = 1; i <= n; i ++ ) {
        cin >> s[i];
        s[i + n] = s[i];
    }
    for (int i = 1; i <= 2 * n; i ++ ) s[i] += s[i - 1];

    int L = 1, R = 2e9;
    while (L <= R) {
        int mid = (L + R) >> 1;
        if (check(mid))
            L = mid + 1;
        else
            R = mid - 1;
    }
    cout << R << " " << n - check(R) << endl;
    return 0;
}

代码如上 本地能运行 然后re了 也没有报错信息 求大佬帮调