Prefix Sum Range Query in C++

#include <stdio.h>
#include <vector>
#include <algorithm>
#include <stdexcept>
#include <cstdint>
#include <limits>
// Prefix Sum Range Query in C++
//
// PURPOSE
// Prefix sums turn a range sum into a subtraction. The preprocessed prefix at index i stores
// the sum of all elements before i.
//
// METHOD
// Build prefix[i+1] = prefix[i] + a[i]. For inclusive bounds left and right, subtract
// prefix[left] from prefix[right+1]. Build once and reuse the prefix for many queries in a
// real application.
//
// COMPLEXITY
// O(n) preprocessing and O(n) space; each query after preprocessing is O(1). This self-
// contained function includes preprocessing on every call.
//
// CONTRACT
// 0 <= left <= right < n. Returns the inclusive range sum. All prefix totals must fit.
// Public APIs infer array lengths except in C, which accepts pointer/length pairs. Vertex
// counts and matrix dimensions remain explicit. Arrays must contain signed 32-bit integers.
// Sorted order, correct tree topology, and caller-owned data-structure invariants are
// preconditions; checking them on every query would change query complexity.
// Scalar and shape checks are included. Value-range checks are included where needed to
// prevent invalid indexing or nontermination. Allocation sizes are capped at 4,000,000
// workspace entries. Arithmetic outside Python raises an error on 32-bit overflow; Python
// uses arbitrary precision. Native allocation failures propagate. In-place outputs may be
// partly updated after arithmetic failure. These are single-threaded, in-memory
// implementations.
//
// LANGUAGE DETAILS
// C++17: const vector references for inputs, mutable references for outputs, RAII workspace,
// standard lower_bound for LIS. Invalid inputs throw invalid_argument; overflow throws
// overflow_error; allocation failure propagates bad_alloc.
//
// EXAMPLE
// Expected return: 6.
// Run: g++ -std=c++17 -O2 example.cpp -o example && ./example
// Tests for this exact source artifact run before publication. The accompanying source
// archive includes unit cases, runtime results, and source hashes.

static int alg_min(int a, int b) { return a < b ? a : b; }
static int alg_max(int a, int b) { return a > b ? a : b; }
static void alg_require(bool valid) { if (!valid) throw std::invalid_argument("invalid algorithm input"); }
static int alg_checked(int64_t v) { if (v < INT32_MIN || v > INT32_MAX) throw std::overflow_error("32-bit result overflow"); return (int)v; }
static int alg_add(int a,int b) { return alg_checked((int64_t)a+b); }
static int alg_sub(int a,int b) { return alg_checked((int64_t)a-b); }
static int alg_mul(int a,int b) { return alg_checked((int64_t)a*b); }
static size_t alg_size(int n) { alg_require(n>=0 && n<=4000000); return (size_t)n; }

int range_sum(const std::vector<int>& a, int left, int right) {
    alg_require(a.size() <= 1000000);
    int n = (int)a.size();
    alg_require(((n >= 0) && (n <= 1000000)));
    alg_require(((int)a.size() == n));
    alg_require(((left >= 0) && (left <= right) && (right < n)));
    std::vector<int> prefix(alg_size(alg_add(n, 1)), 0);
    int i = 0;
    while ((i < n)) {
        prefix[alg_add(i, 1)] = alg_add(prefix[i], a[i]);
        i = alg_add(i, 1);
    }
    return alg_sub(prefix[alg_add(right, 1)], prefix[left]);
}

int main(void) {
    std::vector<int> a = {2, 4, -1, 3};
    int left = 1;
    int right = 3;
    int result = range_sum(a, left, right);
    printf("%d\n", result);
    return 0;
}