PAT A1040 A1043后者请朗读并背诵全文……

emmmmm A1040没有满分
借鉴别人的答案……我逻辑思维不行啊……

#include <iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<cmath>
using namespace std;
#define maxn 1010
string S;
int dp[maxn][maxn];
int main()
{
    getline(cin,S);
    int len=S.length();
    int ans=1;
    for(int i=0;i<len;i++)
    {
        dp[i][i]=1;
        if(i<len-1)
        {
        if(S[i]==S[i+1])
            {
                dp[i][i+1]=1;
                ans=2;
            }
        }
    }
    for(int L=3;L<=len;L++)//可以理解为L是步长
    {
        for(int i=0;i+L-1<len;i++)//保证左边不超边界
        {
            int j=i+L-1;//左边界
            if(S[i]==S[j]&&dp[i+1][j-1])//保证L内部已经经过验证
            {
                dp[i][j]=1;
                ans=L;
            }
        }
    }
    printf("%d\n",ans);
    return 0;
}

A1043看的答案，复现的代码，自己写通，细节蛮多的，这个树的遍历和Dijskra（我还是不会拼）一样，多写才能记住，不难。

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

struct node
{
	int data;
	node *r, *l;
};

vector<int>org, pre, prem, pos;

void insert_tree(int data, node* &root)
{
	if (root == NULL)
	{
		root = new node;
		root->data = data;
		root->l = root->r = NULL;
		return;
	}
	if (data >= root->data) insert_tree(data, root->r);
	else insert_tree(data, root->l);
}

void pre_tree(node *root, vector<int>&pre)
{
	if (root == NULL)
		return;
	pre.push_back(root->data);
	pre_tree(root->l, pre);
	pre_tree(root->r, pre);
}

void pre_m_tree(node *root, vector<int>&prem)
{
	if (root == NULL)
		return;
	prem.push_back(root->data);
	pre_m_tree(root->r, prem);
	pre_m_tree(root->l, prem);
}

void pos_tree(node *root, vector<int>&pos)
{
	if (root == NULL) return;
	pos_tree(root->l, pos);
	pos_tree(root->r, pos);
	pos.push_back(root->data);
}

void pos_m_tree(node *root, vector<int>&pos)
{
	if (root == NULL) return;
	pos_m_tree(root->r, pos);
	pos_m_tree(root->l, pos);
	pos.push_back(root->data);
}

int main()
{
	int num, data;
	cin >> num;
	node *root = NULL;
	while (num--)
	{
		cin >> data;
		org.push_back(data);
		insert_tree(data, root);
	}
	pre_tree(root, pre);
	pre_m_tree(root, prem);
	if (pre == org)
	{
		cout << "YES" << endl;
		pos_tree(root, pos);
		for (int i = 0; i < pos.size(); i++)
		{
			cout << pos[i];
			if (i < pos.size() - 1)
				cout << " ";
		}
	}
	else if (org == prem)
	{
		cout << "YES" << endl;
		pos_m_tree(root, pos);
		for (int i = 0; i < pos.size(); i++)
		{
			cout << pos[i];
			if (i < pos.size() - 1)
				cout << " ";
		}
	}
	else
		cout << "NO" ;
	return 0;
}

思路就是先构建树，有了树，各种遍历都能写出来。