diff options
| -rw-r--r-- | datastructures/segmentTree.cpp | 2 | ||||
| -rw-r--r-- | graph/articulationPoints.cpp | 2 | ||||
| -rw-r--r-- | graph/maxCarBiMatch.cpp | 2 | ||||
| -rw-r--r-- | tcr.pdf | bin | 316161 -> 315950 bytes |
4 files changed, 2 insertions, 4 deletions
diff --git a/datastructures/segmentTree.cpp b/datastructures/segmentTree.cpp index c810af7..3905151 100644 --- a/datastructures/segmentTree.cpp +++ b/datastructures/segmentTree.cpp @@ -2,8 +2,6 @@ // 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. diff --git a/graph/articulationPoints.cpp b/graph/articulationPoints.cpp index e7139d0..fba08bb 100644 --- a/graph/articulationPoints.cpp +++ b/graph/articulationPoints.cpp @@ -23,7 +23,7 @@ void findArticulationPoints() { counter = 0; low.resize(adjlist.size()); d.assign(adjlist.size(), 0); - isArtPoint.assign(adjlist.size(), false); + isArt.assign(adjlist.size(), false); bridges.clear(); //nur fuer Bruecken for (int v = 0; v < (int)adjlist.size(); v++) { if (!d[v]) { diff --git a/graph/maxCarBiMatch.cpp b/graph/maxCarBiMatch.cpp index e538a19..24aebef 100644 --- a/graph/maxCarBiMatch.cpp +++ b/graph/maxCarBiMatch.cpp @@ -14,7 +14,7 @@ bool dfs(int v) { } int kuhn(int n) { // n = #Knoten links. - pairs.assign(NUM_VERTICES, -1); + pairs.assign(adjlist.size(), -1); int ans = 0; // Greedy Matching. Optionale Beschleunigung. for (int i = 0; i < n; i++) for (auto w : adjlist[i]) Binary files differ |