UVA - 401 Palindromes

题目大意：判断是否回文、镜面。回文即从左往右与从右往左相同。镜面根据所提供的表格，可能存在非法字符。一开始理解错题意，以为不存在非法字符就是镜面，实际上是从左往右根据表格将全部字符化为镜像后，要与从右往左相同。

解题思路：回文简单不赘述。用数组把镜像按顺序存储，字母和数字要分开，判断的时候读取对应镜像与从右数相同位置的字符比较。范围是 (l+1)/2 不是 l/2，卡了好久QwQ

#include<iostream>
#include<cstdio>
#include<string.h>
using namespace std;
char str[1000005];
char zimu[]="A   3  HIL JM O   2TUVWXY5";
char shuzi[]="1SE Z  8 ";
int main() {
    memset (str, '0', sizeof(str));
    while (scanf("%s", str) != EOF){
        int l = strlen(str);
        int pa = 1, mi = 1;
        for (int i = 0; i < (l+1)/2; i++){
            if (str[i] != str[l-i-1])
                pa = 0;
            if (str[i] >= 'A' && str[i] <= 'Z' && zimu[str[i]-'A'] != str[l-i-1]) mi = 0;
            if (str[i] >= '1' && str[i] <= '9' && shuzi[str[i]-'1'] != str[l-i-1]) mi = 0;
        }
        printf("%s", str);
        if (pa+mi == 0) printf(" -- is not a palindrome.\n");
        if (pa+mi == 1) printf(pa?" -- is a regular palindrome.\n":" -- is a mirrored string.\n");
        if (pa+mi == 2) printf(" -- is a mirrored palindrome.\n");
        printf("\n");   
    }
return 0;
}