제출 #464693

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
464693		prvocislo	새로운 문제 (POI11_roz)	C++17	100 / 100	102 ms	2408 KiB

roz

#include <iostream>
#include <vector>
#include <set>
#include <algorithm>
using namespace std;

const int maxn = 1e6 + 5, abc = 26;
int ans = 0;
int pf[abc][abc], pfmin[abc][abc], last[abc][abc];
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	int n;
	cin >> n;
	string s;
	cin >> s;
	for (int i = 0; i < abc; i++) for (int j = 0; j < abc; j++) pfmin[i][j] = 1e9;
	for (int i = 0; i < n; i++)
	{
		int a = s[i] - 'a';
		for (int b = 0; b < abc; b++) if (a ^ b)
		{
			pf[a][b]++;
			ans = max(ans, pf[a][b] - pfmin[a][b]);
			pfmin[b][a] = min(pfmin[b][a], last[b][a]);
			last[b][a] = --pf[b][a];
			ans = max(ans, pf[b][a] - pfmin[b][a]);
		}
	}
	cout << ans << "\n";
	return 0;
}

• 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