Iterative Segment Tree Build in C++

#include <stdio.h>
#include <vector>
#include <algorithm>
#include <stdexcept>
#include <cstdint>
#include <limits>
// Iterative Segment Tree Build in C++
//
// PURPOSE
// An iterative sum segment tree stores leaves in the second half of a flat array and parents
// in the first half.
//
// METHOD
// Copy values into tree[n+i], then compute every internal node from its two children in
// descending index order.
//
// COMPLEXITY
// O(n) time and O(1) auxiliary space beyond caller-owned tree.
//
// CONTRACT
// n>=1, tree length is 2*n. Build once and reuse for point assignments and half-open range
// queries. Sums 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: 0.
// Expected tree after call: [0, 10, 3, 7, 1, 2, 3, 4].
// 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 segment_build(const std::vector<int>& a, std::vector<int>& tree) {
    alg_require(a.size() <= 1000000);
    alg_require(tree.size() <= 1000000);
    int n = (int)a.size();
    alg_require(((n >= 0) && (n <= 1000000)));
    alg_require(((int)a.size() == n));
    alg_require(((int)tree.size() == alg_mul(2, n)));
    alg_require((n >= 1));
    int i = 0;
    tree[0] = 0;
    while ((i < n)) {
        tree[alg_add(n, i)] = a[i];
        i = alg_add(i, 1);
    }
    i = alg_sub(n, 1);
    while ((i > 0)) {
        tree[i] = alg_add(tree[alg_mul(2, i)], tree[alg_add(alg_mul(2, i), 1)]);
        i = alg_sub(i, 1);
    }
    return 0;
}

int main(void) {
    std::vector<int> a = {1, 2, 3, 4};
    std::vector<int> tree = {0, 0, 0, 0, 0, 0, 0, 0};
    int result = segment_build(a, tree);
    printf("%d\n", result);
    // Expected tree: [0, 10, 3, 7, 1, 2, 3, 4]
    for (int alg_print = 0; alg_print < 8; alg_print++) printf("%d ", tree[alg_print]);
    printf("\n");
    return 0;
}