第四届河南省程序设计大赛 - 部分题解

最新推荐文章于 2022-10-05 20:08:58 发布

原创

最新推荐文章于 2022-10-05 20:08:58 发布 · 1.2k 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#ACM #河南 #河南省省赛 #第四届 #NYOJ

本文分享了第四届河南省程序设计大赛的部分题目解法，包括Substring问题、序号互换的注意事项和表达式求值的简单栈应用。在序号互换中，需注意数字与字母的对应关系；表达式求值通过维护一个符号栈和一个数字栈，实现了高效计算。

Substring

时间限制： 1000 ms | 内存限制： 65535 KB

难度： 1

描述

You are given a string input. You are to find the longest substring of input such that the reversal of the substring is also a substring of input. In case of a tie, return the string that occurs earliest in input.

Note well: The substring and its reversal may overlap partially or completely. The entire original string is itself a valid substring . The best we can do is find a one character substring, so we implement the tie-breaker rule of taking the earliest one first.

输入

The first line of input gives a single integer, 1 ≤ N ≤ 10, the number of test cases. Then follow, for each test case, a line containing between 1 and 50 characters, inclusive. Each character of input will be an uppercase letter ('A'-'Z').

输出

Output for each test case the longest substring of input such that the reversal of the substring is also a substring of input

样例输入

3                   
ABCABA
XYZ
XCVCX

样例输出

ABA
X
XCVCX

来源

第四届河南省程序设计大赛

AC代码：

#include <cstdio>
#include <cstring>
using namespace std; 

int main()
{
	int n, k;
	char a[55], b[55], c[55][55];
	scanf("%d", &n);
	while(n--)
	{
		int max=0;
		memset(c, 0, sizeof(c));