Cod sursa(job #3330156)

Utilizator hrib_the_slothAndreea Pasca hrib_the_sloth Data 17 decembrie 2025 21:50:33
Problema Cuburi2 Scor 51
Compilator cpp-64 Status done
Runda Arhiva de probleme Marime 1.09 kb
#include <bits/stdc++.h>
using namespace std;
typedef long long i8;

vector<i8> pfx1, pfx2;

i8 cost_dreapta(int i, int b) {
  return (pfx2[b] - pfx2[i]) - i * (pfx1[b] - pfx1[i]);
}
i8 cost_stanga(int i, int a) {
  return i * (pfx1[i - 1] - pfx1[a - 1]) - (pfx2[i - 1] - pfx2[a - 1]);
}
i8 cost_total(int i, int a, int b) {
  return cost_dreapta(i, b) + cost_stanga(i, a);
}
int main() {
  ifstream cin("cuburi2.in");
  ofstream cout("cuburi2.out");
  int n, m;
  cin >> n >> m;

  vector<int> v(n + 1);
  pfx1.resize(n + 1);
  pfx2.resize(n + 1);
  pfx1[0] = 0;
  pfx2[0] = 0;
  for (int i = 1; i <= n; i++) {
    cin >> v[i];
    pfx1[i] = pfx1[i - 1] + v[i];
    pfx2[i] = pfx2[i - 1] + i * v[i];
  }

  for (int i = 0; i < m; i++) {
    int a, b;
    cin >> a >> b;
    i8 x = (pfx1[b] - pfx1[a - 1]) / 2 + 1;

    int l = a;
    int r = b;
    int sol = -1;
    while (l <= r) {
      int mid = (l + r) / 2;

      if (pfx1[mid] - pfx1[a - 1] < x) {
        l = mid + 1;
      } else {
        sol = mid;
        r = mid - 1;
      }
    }

    cout << sol << " " << cost_total(sol, a, b) << "\n";
  }
  return 0;
}