MCPcopy Create free account
hub / github.com/cp-algorithms/cp-algorithms / main

Function main

test/test_lichaotree.cpp:10–33  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

8#include "lichaotree_getminimum.h"
9
10int main() {
11 vector<point> input_lines{
12 {15, 125},
13 {-1, 5000},
14 {-10, 10000},
15 {50, -2400},
16 {17, 3000},
17 {0, 100}
18 };
19
20 point r = {0, (int)1e9};
21 fill(line, line+4*maxn, r);
22 for (int i = 0; i < (int)input_lines.size(); i++) {
23 add_line(input_lines[i]);
24
25 for (int x = 0; x <= 1000; x++) {
26 ftype mi = 1e9;
27 for (int j = 0; j <= i; j++) {
28 mi = min(mi, f(input_lines[j], x));
29 }
30 assert(mi == get(x));
31 }
32 }
33}

Callers

nothing calls this directly

Calls

no outgoing calls

Tested by

no test coverage detected