优美字符串

简单动态规划

dp[i] 截止到下标i, 字符串的长度(插入后)

#include<iostream>
#include<vector>
using namespace std;
vector<int> dp(100005, 0);
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        dp.clear();
        string s;
        cin>>s;
        int len = s.size();
        dp[0] = 1;
        for(int i = 1; i < len; i++)
        {
        	if (s[i] == s[i-1])
			{
				dp[i] = dp[i - 1] + 2;
			}
			else
			{
				dp[i] = dp[i - 1] + 1;
			}
        }
        cout << dp[len - 1] << endl;
    }
    return 0;
}