제출 #503110

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
503110		_tien_	Palindromes (APIO14_palindrome)	C++14	0 / 100	1088 ms	3808 KiB

palindrome

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

#define maxn 300005

struct node{
  int startt,endd;
  int length;
  int insertEdg[26];
  int suffixEdg;
};

node root1,root2;
node tree[maxn];
int currNode,ans=1;
int dem[maxn];
string s;
int ptr;

void insertt(int idx){
int tmp=currNode;
while(true){
    int currLength=tree[tmp].length;
    if(idx-currLength>=1 && s[idx] == s[idx-currLength-1])
        break;
    tmp=tree[tmp].suffixEdg;
}
int x=tmp;
while(true){
    int currLength=tree[tmp].length;
    if(idx-currLength>=1 && s[idx] == s[idx-currLength-1])
        dem[tree[x].insertEdg[s[idx]-'a']]++;
    if(x==1||x==2)break;
    x=tree[x].suffixEdg;
}
if(tree[tmp].insertEdg[s[idx]-'a']!=0){
    currNode=tree[tmp].insertEdg[s[idx]-'a'];
    return ;
}
ptr++;dem[ptr]++;
tree[tmp].insertEdg[s[idx]-'a']=ptr;
tree[ptr].length=tree[tmp].length+2;
tree[ptr].endd=idx;
tree[ptr].startt=idx-tree[ptr].length+1;

tmp=tree[tmp].suffixEdg;

currNode=ptr;
if(tree[currNode].length==1){
    tree[currNode].suffixEdg=2;
    return;
}

while(true){
    int currLength=tree[tmp].length;
    if(idx-currLength>=1&&s[idx]==s[idx-currLength-1])
         break;
    tmp=tree[tmp].suffixEdg;
}
tree[currNode].suffixEdg=tree[tmp].insertEdg[s[idx]-'a'];

}
int main(){
    root1.length=-1;
    root1.suffixEdg=1;
    root2.length=0;
    root2.suffixEdg=1;

    tree[1]=root1;
    tree[2]=root2;
    ptr=2;
    currNode=1;
    cin>>s;
    for(int i=0;i<s.length();i++)
        insertt(i);
    for(int i=3;i<=ptr;i++)
        ans=max(ans,tree[i].length*dem[i]);
    cout<<ans;
    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

palindrome.cpp: In function 'int main()':
palindrome.cpp:74:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   74 |     for(int i=0;i<s.length();i++)
      |                 ~^~~~~~~~~~~

• Subtask 1: 0 / 8
• Subtask 2: 0 / 15
• Subtask 3: 0 / 24
• Subtask 4: 0 / 26
• Subtask 5: 0 / 27