제출 #1002298

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1002298		votranngocvy	Difference (POI11_roz)	C++14	100 / 100	62 ms	5464 KiB

roz

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fo(i, a, b) for(int i = a; i <= b; i++)
#define fod(i, a, b) for(int i = a; i >= b; i--)
#define name "DIFFER"
#define getbit(i,j) ((i>>j)&1)
#define pb(x) push_back(x)
#define all(x) x.begin(), x.end()
#define f first
#define s second
const int N = 1e6 + 5;
int n ;
int a[N] , d[N] , xh[N];
int ans = 0;

int main()
{
    //freopen(name".inp","r",stdin);
    //freopen(name".out","w",stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    cin >> n;
    fo(i , 1 , n)
    {
      char x ; cin >> x;
      a[i] = x - 'a' + 1;
      xh[a[i] ] = 1;
    }
    fo(i , 1 ,26)
    {
        if(xh[i] == 1)
        {
            bool ok = 0;
            fo(j , 1 , 26) d[j] = 0;
            fo(j , 1 , n)
            {
                if(a[j] == i)
                {
                    ok = true;
                    fo(x , 1 , 26) d[x]--;
                }
                else if(d[a[j]] < 0)
                {
                    ok = false;
                    d[a[j]] = 0;
                }
                d[a[j]] ++;
                if(ok)
                {
                    ans = max(ans , d[a[j]]);
                }
                else ans = max(ans , d[a[j]] - 1);
            }
        }
    }
    cout << ans;
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 10 / 10
• Subtask 5: 10 / 10
• Subtask 6: 10 / 10
• Subtask 7: 10 / 10
• Subtask 8: 10 / 10
• Subtask 9: 10 / 10
• Subtask 10: 10 / 10