IT

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main() {

    int n;
    cin >> n;

    vector <int> a(n);
    for (int i = 0; i < n; i++)
        cin >> a[i];

    int l = 0, r = a.size() - 1;
    long sum1 = a[0], sum2 = a[a.size() - 1];
    int min = abs(sum1 - sum2);
    int minl = l, minr = r;

    while (l != r) {
        if (sum1 > sum2) {
            r--;
            sum2 += a[r];
        }
        else {
            l++;
            sum1 += a[l];
        }

        if (abs(sum1 - sum2) < min) {
            min = abs(sum1 - sum2);
            minl = l;
            minr = r;
        }
    }

    cout << min << " " <<minl+1 << " "<< minr+1;
    return 0;
}