제출 #1024547

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1024547		KasymK	Palinilap (COI16_palinilap)	C++17	17 / 100	1079 ms	604 KiB

palinilap

#include "bits/stdc++.h"
using namespace std;
#define pb push_back
#define ll long long
#define ff first
#define ss second
#define pii pair<int, int>
#define wr puts("---------------")
#define all(v) v.begin(), v.end()
const int N = 3e5+5;

int weight(string s){
    int ans = 0, n = (int)s.size();
    for(int i = 0; i < n; ++i){
        int sm = 1, l = i-1, r = i+1;
        while(l >= 0 and r < n)
            if(s[l] == s[r])
                sm++, l--, r++;
            else
                break;
        ans += sm;
    }
    for(int i = 0; i < n-1; ++i){
        if(s[i] != s[i+1])
            continue;
        int sm = 1, l = i-1, r = i+2;
        while(l >= 0 and r < n)
            if(s[l] == s[r])
                sm++, l--, r++;
            else
                break;
        ans += sm;
    }
    return ans;
}

int main(){
    string s;
    cin >> s;
    int n = (int)s.size(), answer = weight(s);
    for(int i = 0; i < n; ++i){
        char ad = s[i];
        for(char c = 'a'; c <= 'z'; ++c)
            s[i] = c, answer = max(answer, weight(s));
        s[i] = ad;
    }
    printf("%d", answer);
    return 0;
}

• Subtask 1: 17 / 17
• Subtask 2: 0 / 37
• Subtask 3: 0 / 46