Codeforces Round Div 627

Codeforces Round Div 627

Author: hschoi1104

CodeForce/Round #627 (Div. 3)/B - Yet Another Palindrome Problem.cpp

@@ -1,28 +1,29 @@
 #include <iostream>
 #include <algorithm>
-#include <string>
+#include <vector>
 using namespace std;
+vector<int>v;
 int main() {
 	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
 	int t; cin >> t;
 	while (t--) {
-		string s = ' ';
-		string a; cin >> a;
-		a += 'R';
-		char prev ='L'
-		int dist = 0;
-		int tmp = 0;
-		for (int i = 0; i < s.length(); i++) {
-			if (prev == 'L') {
-				tmp += 1;
-				dist = max(dist, tmp);
-			}
-			else if (prev == 'R') {
-				dist = max(dist, tmp);
-				tmp = 0;
+		int n; cin >> n;
+		bool flag = false;
+		for (int i = 0; i < n; i++) {
+			int x; cin >> x; v.push_back(x);
+		}
+		for (int i = 0; i < v.size() - 2; i++) {
+			if (flag) break;
+			for (int j = i + 2; j < v.size(); j++) {
+				if (v[i] == v[j]) {
+					flag = true;
+					break;
+				}
 			}
-			prev = s[
 		}
+		if (flag) cout << "YES\n";
+		else cout << "NO\n";
+		v.clear();
 	}
 	return 0;
 }

CodeForce/Round #627 (Div. 3)/C- Frog Jumps.cpp CodeForce/Round #627 (Div. 3)/C - Frog Jumps.cpp

@@ -16,7 +16,7 @@ int main() {
 				pos = i;
 			}
 		}
-		tmp = max(tmp, int(s.length()-pos));
+		tmp = max(tmp, int(s.length() - pos));
 		cout << tmp << "\n";
 	}
 	return 0;