Solved problem 1025C from codeforces

Author: AliOsm

CodeForces/1025C. Plasticine zebra.cpp

@@ -0,0 +1,22 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+string s;
+
+int main() {
+  cin >> s;
+  s += s;
+
+  int res = 0;
+  for(int i = 0; i < s.length(); ++i) {
+    int cur = 1;
+    while(i + 1 < s.length() && s[i] != s[i + 1] && cur < s.length() / 2)
+      ++cur, ++i;
+    res = max(res, cur);
+  }
+
+  printf("%d\n", res);
+
+  return 0;
+}

CodeForces/README.md

@@ -556,6 +556,7 @@
 - [1023D. Array Restoration](http://codeforces.com/contest/1023/problem/D)
 - [1025A. Doggo Recoloring](http://codeforces.com/contest/1025/problem/A)
 - [1025B. Weakened Common Divisor](http://codeforces.com/contest/1025/problem/B)
+- [1025C. Plasticine zebra](http://codeforces.com/contest/1025/problem/C)
 - [1027A. Palindromic Twist](http://codeforces.com/contest/1027/problem/A)
 - [1027B. Numbers on the Chessboard](http://codeforces.com/contest/1027/problem/B)
 - [1027C. Minimum Value Rectangle](http://codeforces.com/contest/1027/problem/C)