Algorithms : add 02-data_structures 04-binary_search_trees

1 files changed, 36 insertions, 0 deletions

diff --git a/02-data_structures/04-binary_search_trees/03-rope/rope.cpp b/02-data_structures/04-binary_search_trees/03-rope/rope.cpp
new file mode 100644
index 0000000..d5f5f35
--- /dev/null
+++ b/02-data_structures/04-binary_search_trees/03-rope/rope.cpp
@@ -0,0 +1,36 @@
+#include <cstdio>
+#include <string>
+#include <iostream>
+
+
+class Rope {
+	std::string s;
+public:
+	Rope(const std::string &s) : s(s) { 
+	}
+
+	void process( int i, int j, int k ) {
+                // Replace this code with a faster implementation
+                std::string t = s.substr(0, i) + s.substr(j + 1);
+                s = t.substr(0, k) + s.substr(i, j - i + 1) + t.substr(k);
+	}
+
+	std::string result() {
+		return s;
+	}
+};
+
+int main() {
+	std::ios_base::sync_with_stdio(0);
+	std::string s;
+	std::cin >> s;
+	Rope rope(s);
+	int actions;
+	std::cin >> actions;
+        for (int action_index = 0; action_index < actions; ++action_index) {
+                int i, j, k;
+		std::cin >> i >> j >> k;
+		rope.process(i, j, k);
+	}
+	std::cout << rope.result() << std::endl;
+}