爱奇艺笔试题

#include <iostream>
#include <cstdlib>
#include <stdio.h>
#include <string>

using namespace std;

void LongestSubStr(const string &str) {
	string res(str.size() * 2,'0');
	int i, j;
	j = 0;
	for (i = 0; i < str.size(); i++) {
		res[j++] = str[i];
		res[j++] = '#';
	}
	int len = 0;
	for (int j = 1; j < res.size(); j++) {
		int left = j - 1;
		int right = j + 1;
		int max = 0;
		while (left >= 0 && right < res.size() && res[left] == res[right]) {
			left--; right++;
			++max;
		}
		if (max > len)
			len = max;
	}
	if (len == 0) {
		printf("%d\n", len + 1);
		return;
	}
	printf("%d\n", (len + 1) / 2);

}
int main()
{
	string str;
	while(cin >> str)
		LongestSubStr(str);
	system("pause");
	return 0;
}

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <iostream>

using namespace std;
//0-1背包问题
void DP(int n, int m) {
	float res;

	int *weight = new int[m];
	int *value = new int[m];
	int **dp = new int*[m];  //dp[i][j]表示第i个物品，背包容量为j时的最大价值
	for (int i = 0; i < m; i++)
		dp[i] = new int[n + 1];

	for (int i = 0; i < m; i++)
		cin >> weight[i];
	for (int i = 0; i < m; i++)
		cin >> value[i];

	for (int i = 0; i < m; i++)
		dp[i][0] = 0;
	for (int i = 0; i <= n; i++) { //这里是<=
		if (i >= weight[0])  //这里是>=
			dp[0][i] = value[0];
		else
			dp[0][i] = 0;
	}
	for (int i = 1; i < m; i++) {
		for (int j = 1; j <= n; j++) {
			if (j < weight[i])
				dp[i][j] = dp[i - 1][j];
			else
				dp[i][j] = dp[i - 1][j] > dp[i - 1][j - weight[i]] + value[i] ? dp[i - 1][j] : dp[i - 1][j - weight[i]] + value[i];
		}
	}

	res = dp[m - 1][n] * 0.1;
	printf("%2.1f\n", res);
}

int main()
{
	int m, n;	
	while(cin >> n >> m)  //m表示物品种数
		DP(n, m);
	system("pause");
	return 0;	
}