Educational Codeforces Round 40 (Rated for Div. 2) B. String Typing

最新推荐文章于 2022-05-15 23:00:51 发布

原创最新推荐文章于 2022-05-15 23:00:51 发布 · 888 阅读

0 ·

CC 4.0 BY-SA版权

大学生活之ACM比赛专栏收录该内容

51 篇文章

订阅专栏

本文探讨了如何通过优化字符串操作来减少输入特定字符串所需的最少步骤数，包括直接逐个输入字符及复制粘贴等策略。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

You are given a string s consisting of n lowercase Latin letters. You have to type this string using your keyboard.

Initially, you have an empty string. Until you type the whole string, you may perform the following operation:

add a character to the end of the string.

Besides, at most once you may perform one additional operation: copy the string and append it to itself.

For example, if you have to type string abcabca, you can type it in 7 operations if you type all the characters one by one. However, you can type it in 5 operations if you type the string abc first and then copy it and type the last character.

If you have to type string aaaaaaaaa, the best option is to type 4 characters one by one, then copy the string, and then type the remaining character.

Print the minimum number of operations you need to type the given string.

Input

The first line of the input containing only one integer number n (1 ≤ n ≤ 100) — the length of the string you have to type. The second line containing the string s consisting of n lowercase Latin letters.

Output

Print one integer number — the minimum number of operations you need to type the given string.

Examples
InputCopy
7
abcabca
Output
5
InputCopy
8
abcdefgh
Output
8

Note

The first test described in the problem statement.

In the second test you can only type all the characters one by one.

思路：

一：考虑copy字串的长度少于n/2;

二：从n/2的长度开始搜索看能否copy（检索长度逐渐变短）

三：如果能输出n-能copy的长度

#include <bits/stdc++.h>

using namespace std;
string a;
int main()
{
    int n,ans;
    cin >> n;
    cin >> a;
    ans=n;
    int p=0;
    for(int i=n/2;i>=0;i--)
    {
        for(int j=0;j<=i;j++)
        {
            if(a[j]!=a[i+j+1])
            {
                p=0;
                break;
            }
            else p=1;
        }
        if(p==1)
        {
            cout << n-i<< endl;
            return 0;
        }
    }
    cout << n << endl;
    return 0;
}

→Judgement Protocol