mirror of
https://git.sb/baoshuo/OI-codes.git
synced 2024-12-25 06:31:59 +00:00
A - Palindromic Indices
https://codeforces.com/contest/1682/submission/158020857
This commit is contained in:
parent
74ab0166cc
commit
60c24a78c1
30
Codeforces/1682/A/A.cpp
Normal file
30
Codeforces/1682/A/A.cpp
Normal file
@ -0,0 +1,30 @@
|
|||||||
|
#include <iostream>
|
||||||
|
#include <string>
|
||||||
|
|
||||||
|
using std::cin;
|
||||||
|
using std::cout;
|
||||||
|
const char endl = '\n';
|
||||||
|
|
||||||
|
int t, n;
|
||||||
|
std::string s;
|
||||||
|
|
||||||
|
int main() {
|
||||||
|
std::ios::sync_with_stdio(false);
|
||||||
|
|
||||||
|
cin >> t;
|
||||||
|
|
||||||
|
while (t--) {
|
||||||
|
cin >> n >> s;
|
||||||
|
|
||||||
|
s = ' ' + s;
|
||||||
|
|
||||||
|
int mid = n & 1 ? n / 2 : n / 2 - 1;
|
||||||
|
int ans = 2 - (n & 1);
|
||||||
|
|
||||||
|
for (int i = mid; i && s[i] == s[i + 1]; i--) ans += 2;
|
||||||
|
|
||||||
|
cout << ans << endl;
|
||||||
|
}
|
||||||
|
|
||||||
|
return 0;
|
||||||
|
}
|
Loading…
Reference in New Issue
Block a user