poj 1159 Palindrome - c++编程基础

#include
#include
#define MAX 5002
using namespace std;
unsigned short array [MAX][MAX];
int main(){
int N;
cin>>N;
string input;
cin>>input;
//cout< memset(array,0,sizeof(array));
for(int i=N;i>=1;i--){
for(int j=i+1;j<=N;j++){
if(input[i-1]==input[j-1]){
array[i][j]=array[i+1][j-1];
//cout<<"equal "< }

else{
array[i][j]=1+(array[i][j-1] //cout<<"unequal "< }
}
}
/*
for(int i=0;i for(int j=0;j cout< }
cout< }
*/
cout< return 0;
}