Codeforces Round #436 B

Polycarp and Letters

思路：判连续最长的小写字母

AC代码：

#include "iostream"
#include "iomanip"
#include "string.h"
#include "stack"
#include "queue"
#include "string"
#include "vector"
#include "set"
#include "map"
#include "algorithm"
#include "stdio.h"
#include "math.h"
#pragma comment(linker, "/STACK:102400000,102400000")
#define bug(x) cout<<x<<" "<<"UUUUU"<<endl;
#define mem(a,x) memset(a,x,sizeof(a))
#define step(x) fixed<< setprecision(x)<<
#define mp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define ll long long
#define endl ("\n")
#define ft first
#define sd second
#define lrt (rt<<1)
#define rrt (rt<<1|1)
using namespace std;
const ll mod=1e9+7;
const ll INF = 1e18+1LL;
const int inf = 1e9+1e8;
const double PI=acos(-1.0);
const int N=1e5+100;

char s[1005];
int n;
map<char,int> M;
int check(int t){
    M.clear();
    for(int i=t; i<=n; ++i){
        if(s[i]>='A' && s[i]<='Z') return M.size();
        M[s[i]]=1;
    }
    return M.size();
}

int main(){
    int ans=0;
    cin>>n>>s+1;
    for(int i=1; i<=n; ++i){
        if(s[i]>='a' && s[i]<='z'){
            ans=max(ans,check(i));
        }
    }
    cout<<ans<<endl;
    return 0;
}