FZU 2218 Simple String Problem（状压DP）

思路：注意到k只有16，比较显然的想到状压DP，令dp[s]为s这个状态的最长长度，那么需要枚举反面的子集，显然复杂度会爆炸，有一个很巧妙的地方是将dp[s]表示为s这个状态及其子集的最长长度，这样可以大大减少复杂度，最终复杂度为O(n^2+k*2^k)

#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
int dp[1<<16];
char s[2005];
int main()
{
    int T;
	scanf("%d",&T);
	while(T--)
	{
       int n,k;
	   memset(dp,0,sizeof(dp));
	   scanf("%d%d",&n,&k);
	   scanf("%s",s);
	   for(int i = 0;i<n;i++)
	   {
		   int t = 0;
		   for(int j = i;j<n;j++)
		   {
			   t|=(1<<(s[j]-'a'));
			   dp[t]=max(dp[t],j-i+1);
		   }
	   }
	   for(int i = 0;i<(1<<k);i++)
           for(int j = 0;j<k;j++)
			   if(i&(1<<j))
				   dp[i]=max(dp[i],dp[i^(1<<j)]);
	   int ans = 0;
	   for(int i = 0;i<(1<<k);i++)
		   ans = max(ans,dp[i]*dp[i^((1<<k)-1)]);
	   printf("%d\n",ans);
	}
}

Description

Recently, you have found your interest in string theory. Here is an interesting question about strings.

You are given a string S of length n consisting of the first k lowercase letters.

You are required to find two non-empty substrings (note that substrings must be consecutive) of S, such that the two substrings don't share any same letter. Here comes the question, what is the maximum product of the two substring lengths?

Input

The first line contains an integer T, meaning the number of the cases. 1 <= T <= 50.

For each test case, the first line consists of two integers n and k. (1 <= n <= 2000, 1 <= k <= 16).

The second line is a string of length n, consisting only the first k lowercase letters in the alphabet. For example, when k = 3, it consists of a, b, and c.

Output

For each test case, output the answer of the question.

Sample Input

4
25 5
abcdeabcdeabcdeabcdeabcde
25 5
aaaaabbbbbcccccdddddeeeee
25 5
adcbadcbedbadedcbacbcadbc
3 2
aaa

Sample Output

6
150
21
0

Hint

One possible option for the two chosen substrings for the first sample is "abc" and "de".

The two chosen substrings for the third sample are "ded" and "cbacbca".

In the fourth sample, we can't choose such two non-empty substrings, so the answer is 0.