C. Remove Adjacent

时间：2020-04-23 22:44:20 阅读：64 评论：0 收藏：0 [点我收藏+]

标签：anything copy ons provided getchar sample stream inline during

You are given a string

In one operation, you can choose some index

For the character

Consider the following example. Let

During the first move, you can remove the first character
During the second move, you can remove the fifth character
During the third move, you can remove the sixth character
During the fourth move, the only character you can remove is

Your task is to find the maximum possible number of characters you can remove if you choose the sequence of operations optimally.

Input

The first line of the input contains one integer

The second line of the input contains one string

Output

Print one integer — the maximum possible number of characters you can remove if you choose the sequence of moves optimally.

Examples

input

Copy

8
bacabcab

output

Copy

input

Copy

4
bcda

output

Copy

input

Copy

6
abbbbb

output

Copy

Note

The first example is described in the problem statement. Note that the sequence of moves provided in the statement is not the only, but it can be shown that the maximum possible answer to this test is

In the second example, you can remove all but one character of

During the first move, remove the third character
During the second move, remove the second character
And during the third move, remove the first character

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <set>
#include <queue>
#include <map>
#include <sstream>
#include <cstdio>
#include <cstring>
#include <numeric>
#include <cmath>
#include <iomanip>
#include <deque>
#include <bitset>
//#include <unordered_set>
//#include <unordered_map>
//#include <bits/stdc++.h>
//#include <xfunctional>
#define ll              long long
#define PII             pair<int, int>
#define rep(i,a,b)      for(int  i=a;i<=b;i++)
#define dec(i,a,b)      for(int  i=a;i>=b;i--)
#define pb              push_back
#define mk              make_pair
using namespace std;
int dir1[6][2] = { { 0,1 } ,{ 0,-1 },{ 1,0 },{ -1,0 },{ 1,1 },{ -1,1 } };
int dir2[6][2] = { { 0,1 } ,{ 0,-1 },{ 1,0 },{ -1,0 },{ 1,-1 },{ -1,-1 } };
const long long INF = 0x7f7f7f7f7f7f7f7f;
const int inf = 0x3f3f3f3f;
const double pi = 3.14159265358979;
const int mod = 1e9 + 7;
const int N = 30005;
//if(x<0 || x>=r || y<0 || y>=c)

inline ll read()
{
    ll x = 0; bool f = true; char c = getchar();
    while (c < ‘0‘ || c > ‘9‘) { if (c == ‘-‘) f = false; c = getchar(); }
    while (c >= ‘0‘ && c <= ‘9‘) x = (x << 1) + (x << 3) + (c ^ 48), c = getchar();
    return f ? x : -x;
}

int main()
{
    int n;
    cin >> n;
    string s;
    cin >> s;
    bool fg=1;
    int ans = 0;
    for (char c = ‘z‘; c >= ‘a‘; c--)
        for (int i = 0; i<s.size(); i++)
            if (s[i] == c && (i>0 && s[i - 1] == c - 1 || i<s.size() - 1 && s[i + 1] == c - 1))
                s.erase(s.begin() + i), i = -1, ans++;
    cout << ans << endl;
    return 0;
}

C. Remove Adjacent

标签：anything copy ons provided getchar sample stream inline during

原文地址：https://www.cnblogs.com/dealer/p/12763955.html

踩

(0)

评论一句话评论（0）

分享档案

更多>

2021年07月29日 (22)
2021年07月28日 (40)
2021年07月27日 (32)
2021年07月26日 (79)
2021年07月23日 (29)
2021年07月22日 (30)
2021年07月21日 (42)
2021年07月20日 (16)
2021年07月19日 (90)
2021年07月16日 (35)

周排行