USACO 1.3 Calf Flac

代码很挫的，不过是自己借鉴大牛的思路后写的……

/*
ID: wangxin12
PROG: calfflac
LANG: C++
*/

#include <iostream>
#include <fstream>
#include <vector>
#include <string>
#include <set>
#include <stdio.h>
#include <stdlib.h>


using namespace std;


#define MAX 20001


int len;


vector<char> final;


bool Equal(char cal[MAX], int & left, int & right) {


if(left <= 0 || right >= len) return false;


int tleft = left - 1, tright = right + 1;
while( tleft - 1 >= 0 && (!isalpha(cal[tleft]))) tleft--;
while( tright + 1 <= len && (!isalpha(cal[tright]))) tright++;

char tl = tolower(cal[tleft]);
char tr = tolower(cal[tright]);
if( tl == tr) {
left = tleft;
right = tright;
return true;
} else {
return false;
}
}


//bool DEqual(char cal[MAX], int & left, int & right) {
// if(left <= 0 || right >= len) return false;
//
//}






void IsPalindrome(char cal[MAX], int & pivot, int & left, int & right){
vector<char> tempresult;


while(Equal(cal, left,right)) {


}


int index = left;
while(index <= right) {
tempresult.push_back(cal[index]);
index++;
}


if(tempresult.size() > final.size()) {
final.clear();
for(int k = 0; k < tempresult.size(); k++) {
final.push_back(tempresult[k]);
}
}
}


void IsDPalindrome(char cal[MAX], int & pivot, int & left, int & right){
vector<char> tempresult;
if(cal[left] == cal[right]) {
while(Equal(cal, left,right)) {
}
} else {
return;
}


int index = left;
while(index <= right) {
tempresult.push_back(cal[index]);
index++;
}


if(tempresult.size() > final.size()) {
final.clear();
for(int k = 0; k < tempresult.size(); k++) {
final.push_back(tempresult[k]);
}
}
}


int main() {
FILE * fin = fopen("in.txt", "r");

ofstream fout("out.txt");

char cal[MAX];

int i = 0;
while(EOF != (cal[i++] = fgetc(fin)));
len = i;

int pivot = 0, left = 0, right = 0;
/*单回文*/
while(pivot <= len) {
left = pivot;
right = pivot;

IsPalindrome(cal, pivot, left, right);   //

pivot++;
}


/*双回文*/
pivot = 0;
while(pivot < len) {
left = pivot;
right = pivot + 1;

IsDPalindrome(cal, pivot, left, right);   //

pivot++;


}


//输出
int charLen = 0;
for(int k = 0; k < final.size(); k++) {
if(isalpha(final[k])) charLen++;
}
fout<<charLen<<endl;


for(int k = 0; k < final.size(); k++) {
fout<<final[k];
}
fout<<endl;


fclose(fin);
fout.close();

    return 0;
}