[luogu]CF191A Dynasty Puzzles dp

前言

传送门 :

思路

字符串拼接 首尾相连 问最大长度 直接dp

Mycode

// Problem: CF191A Dynasty Puzzles
// Contest: Luogu
// URL: https://www.luogu.com.cn/problem/CF191A
// Memory Limit: 250 MB
// Time Limit: 2000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

//��һ�δ��Ϻ�վ֮�� ��Ϊʹ��#define int long long TLE���¿��˺ܾõ�ʱ�� ���˼���ģ��
//����ʹ�ø��ӵ�ģ��

#include 
#include 
#include 
#include 
#include 
#include 
using namespace std;
#define IOS  ios::sync_with_stdio(false);
#define CIT  cin.tie(0);
#define COT  cout.tie(0);

#define ll long long
#define x first
#define y second
#define pb push_back
#define endl '\n'
#define all(x) (x).begin(),x.end()


typedef priority_queue  Pri_m;
typedef pair pii;
typedef vector VI;
map mp;

const int N  = 27;
int f[N][N];
char s[10];

void solve()
{
	int n;
	cin>>n;
	for(int i = 1;i