Cod sursa(job #1758883)

Utilizator fanache99Constantin-Buliga Stefan fanache99 Data 18 septembrie 2016 00:27:11
Problema Cuburi2 Scor 100
Compilator cpp Status done
Runda Arhiva de probleme Marime 2.03 kb
#include <fstream>
#include <vector>
#include <algorithm>

using namespace std;

class InputReader {
    public:
        InputReader() {}
        InputReader(const char *file_name) {
            input_file = fopen(file_name, "r");
            cursor = 0;
            fread(buffer, SIZE, 1, input_file);
        }
        inline InputReader &operator >>(int &n) {
            while(buffer[cursor] < '0' || buffer[cursor] > '9') {
                advance();
            }
            n = 0;
            while('0' <= buffer[cursor] && buffer[cursor] <= '9') {
                n = n * 10 + buffer[cursor] - '0';
                advance();
            }
            return *this;
        }
    private:
        FILE *input_file;
        static const int SIZE = 1 << 17;
        int cursor;
        char buffer[SIZE];
        inline void advance() {
            ++ cursor;
            if(cursor == SIZE) {
                cursor = 0;
                fread(buffer, SIZE, 1, input_file);
            }
        }
};

InputReader cin("cuburi2.in");
ofstream cout("cuburi2.out");

const int MAXN = 250000;

long long sum[1 + MAXN], sumSum[1 + MAXN], inverseSum[1 + MAXN];

int main() {
    int n, m;
    cin >> n >> m;
    for (int i = 1; i <= n; i++) {
        int x;
        cin >> x;
        sum[i] = sum[i - 1] + x;
        sumSum[i] = sumSum[i - 1] + sum[i - 1];
    }
    for (int i = n - 1; i; i--)
        inverseSum[i] = inverseSum[i + 1] + sum[n] - sum[i];
    for (int i = 1; i <= m; i++) {
        int a, b;
        cin >> a >> b;
        int answer = a, step;
        for (step = 1; step <= b - a; step *= 2);
        for (step; step; step /= 2)
            if (answer + step <= b && sum[answer + step - 1] - sum[a - 1] < sum[b] - sum[answer + step - 1])
                answer += step;
        long long value = sumSum[answer] - sumSum[a] - sum[a - 1] * (answer - a) + inverseSum[answer] - inverseSum[b] - (sum[n] - sum[b]) * (b - answer);
        cout << answer << " " << value << "\n";
    }
    return 0;
}