# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
471965 | malar | 회문 (APIO14_palindrome) | C++14 | 1090 ms | 131076 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
using namespace std;
bool isPalindrome(string str) {
for(int i = 0; i <str.length()/2; i++) {
if(str[i] != str[str.length()-1-i]) {
return false;
}
}
return true;
}
int findPosition(string array[], string sub, int size) {
for(int i = 0; i < size; i++) {
if(array[i] == sub) {
return i;
}
}
return -1;
}
int findMax(int array[], int maxPos) {
int max = array[0];
for(int i = 1; i <= maxPos; i++) {
if(array[i] > max) {
max = array[i];
}
}
return max;
}
int main() {
string str;
cin >> str;
string substr[str.length()];
int times[str.length()];
int points[str.length()];
string temp;
int maxIndex = -1;
for(int i = 0; i < str.length(); i++) {
temp = "";
for(int k=i; k < str.length(); k++) {
temp = temp + str[k];
if(isPalindrome(temp)) {
int pos = findPosition(substr, temp, maxIndex);
if(pos >= 0) {
times[pos] = times[pos] + 1;
} else{
maxIndex++;
substr[maxIndex] = temp;
times[maxIndex] = 1;
}
}
}
}
for(int i = 0; i <= maxIndex; i++) {
points[i] = substr[i].length() * times[i];
}
cout << findMax(points, maxIndex);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |