Alphabet Gym - 101291A

最新推荐文章于 2021-08-04 15:15:41 发布

newhonor

最新推荐文章于 2021-08-04 15:15:41 发布

阅读量130

点赞数

分类专栏： dp

本文链接：https://blog.csdn.net/weixin_39132605/article/details/102235526

版权

dp 专栏收录该内容

56 篇文章 0 订阅

订阅专栏

本文详细解析了Alphabet Gym的编程题101291A，涵盖了问题背景、解题思路、算法实现及代码优化等方面，适合编程爱好者和竞赛选手学习参考。

摘要由CSDN通过智能技术生成

https://cn.vjudge.net/problem/Gym-101291A

#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <set>
#include <map>
#include <stack>
//#include <tr1/unordered_map>
#include <unordered_map>
#include <cmath>
//#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
//#define sfl(i) scanf("%I64d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define prl(i) printf("%I64d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define uint unsigned int
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define inf 8e19
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson (rt<<1)
#define rson (rt<<1|1)
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

template<typename T>inline void read(T &x)
{
    x=0;
    static int p;p=1;
    static char c;c=getchar();
    while(!isdigit(c)){if(c=='-')p=-1;c=getchar();}
    while(isdigit(c)) {x=(x<<1)+(x<<3)+(c-48);c=getchar();}
    x*=p;
}

//-----------------------------------------------
const int maxn=1e6+9;
const int mod=1e9+7;

int dp[66];
char s[66];
int main()
{
    //FAST_IO;

    //freopen("input.txt","r",stdin);

    while(~scanf("%s",s+1))
    {
        int maxx=0;
        mem(dp,0);
        int len=strlen(s+1);
        for(int i=1;i<=len;i++)
        {
            dp[i]=1;
            for(int j=1;j<i;j++)
            {
                if(s[j]<s[i])
                {
                    dp[i]=max(dp[j]+1,dp[i]);
                }
            }
            maxx=max(maxx,dp[i]);
        }
        printf("%d\n",26-maxx);
    }



    return 0;
}