山（字符串，回文，不下降）（蓝桥杯2022）

本文链接：https://blog.csdn.net/Kingcarry6/article/details/129381800

#include <iostream>
#include <bits/stdc++.h>
#include <cstring>
#include <algorithm>
#include <vector>
#include <set>
#include <queue>
#define x first
#define y second
#define endl '\n'
#define ms(x,y) memset(x,y,sizeof x)
#define ios ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
using namespace std;
 
typedef long long LL;
typedef pair<int,int> PII;
typedef pair<double,double> PDD;
typedef pair<char,int> PCI;
typedef pair<string,int> PSI;
typedef pair<int,string> PIS;
typedef pair<LL,LL> PLL;
//typedef __int128 i128;
typedef unsigned long long ULL;
const int N = 3000+  10,M = N *6 ;
const LL INF = 2022222022,mod = 1e9 + 7 ,P = 131;
const double eps = 1e-7;
 
 
 
 
 
void solve()
{
    int ans=0;
    string s;
    int i;
    for( i=11;i<=20222;i ++ )
    {
        s =to_string(i);
        bool flag =1;
        
        //判断不下降
        for(int j=0;j<s.size()-1;j ++ )
        if(s[j] > s[j + 1 ])
        {
            flag =0 ;
            break;
        }
        
        
        
        if(flag )
        {
            if(i > 21)ans ++; // 2222 //不考虑在中间插入
            if(s.size() * 2 + 1 <= 10)//11x11//考虑在中间插入
            {
                int t= s[s.size() -1 ] - '0';
                ans += 10 - t;
            }
        }
        
        
        
                
    }
    
    cout<< ans <<endl;
    
    
}
 
signed main()
{
//  freopen("1.txt","w",stdout);
    ios
 
    int T=1;
//    cin>>T;
    int now = 1;
    while(T -- )
    {
//      cout<<"Case "; 
//      cout<<"Scenario #"; 
//      cout<< now ++ <<": ";
        solve();
    }
 
 
    return 0;
}