제출 #202650

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
202650		SorahISA	Lampice (COCI19_lampice)	C++17	25 / 110	1396 ms	632 KiB

lampice

#include <bits/stdc++.h>
using namespace std;

#define int long long
#define double long double

#define fastIO() ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

int32_t main() {
    fastIO();
    
    int n, maxAns = 1;
    string s;
    cin >> n >> s;
    
    /// for subtask 2 : the tree is a chain ///
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < min(i+1, n-i); ++j) {
            if (s[i - j] != s[i + j]) {
                maxAns = max(maxAns, 2*j - 1);
                break;
            }
            if (j == min(i+1, n-i) - 1) {
                maxAns = max(maxAns, 2*j + 1);
            }
        }
        for (int j = 0; j < min(i+1, n-i-1); ++j) {
            if (s[i - j] != s[i + j + 1]) {
                maxAns = max(maxAns, 2*j);
                break;
            }
            if (j == min(i+1, n-i-1) - 1) {
                maxAns = max(maxAns, 2*j + 2);
            }
        }
    }
    
    cout << maxAns << "\n";
    
    return 0;
}

• Subtask 1: 0 / 17
• Subtask 2: 25 / 25
• Subtask 3: 0 / 31
• Subtask 4: 0 / 37