From 92f02961b71c82c91d2968c0b1f392c89d0dc57f Mon Sep 17 00:00:00 2001 From: Paul Jungeblut Date: Thu, 4 May 2017 16:22:27 +0200 Subject: Adding fast Input/Output and Manacher's algorithm. --- datastructures/segmentTree.cpp | 2 ++ 1 file changed, 2 insertions(+) (limited to 'datastructures/segmentTree.cpp') diff --git a/datastructures/segmentTree.cpp b/datastructures/segmentTree.cpp index 3905151..c810af7 100644 --- a/datastructures/segmentTree.cpp +++ b/datastructures/segmentTree.cpp @@ -2,6 +2,8 @@ // Berechnet das Maximum im Array. int a[MAX_N], m[4 * MAX_N]; +int gcd(int a, int b) { return b == 0 ? a : gcd (b, a % b); } + int query(int x, int y, int k = 0, int X = 0, int Y = MAX_N - 1) { if (x <= X && Y <= y) return m[k]; if (y < X || Y < x) return -INF; // Ein "neutrales" Element. -- cgit v1.2.3