Submission #47239

#	Time	Username	Problem	Language	Result	Execution time	Memory
47239		marvenlee	Palindromes (APIO14_palindrome)	C++14	8 / 100	1091 ms	1432 KiB

palindrome

#include <iostream>
#include <string>
using namespace std;

int main()
{
    int maxans=0;
    int subans=0;
    string s;
    cin >> s;
    for(int i=0;i<s.length();i++)
    {
        for(int j=s.length()-1;j>=i;j--)
        {
            subans=0;
            int start=i,last=j,state=0;
            while(start<=last)
            {
                if(s[start]!=s[last])
                {
                    state=1;
                    break;
                }
                start++;last--;
            }
            if(state == 0)
            {
                string s2= s.substr(i,j-i+1);
                subans =s2.length();
                int finaloccur = s.rfind(s2);
                int countoccur=1;
                int found=-1;
                while(s.find(s2,found+1)!=finaloccur)
                {
                    countoccur+=1;
                    found =s.find(s2,found+1);
                }
                subans*=countoccur;
                if(subans>maxans)maxans=subans;
            }
        }
    }
    cout << maxans;
    return 0;
}

Compilation message (stderr)

palindrome.cpp: In function 'int main()':
palindrome.cpp:11:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<s.length();i++)
                 ~^~~~~~~~~~~
palindrome.cpp:33:41: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 while(s.find(s2,found+1)!=finaloccur)
                       ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~

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