Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #define task "SUBSTR"
- #include <iostream>
- #include <cstdio>
- #include <vector>
- using namespace std;
- using ll = long long;
- using ld = long double;
- constexpr int N = 1e5 + 5;
- string s;
- void Read()
- {
- cin >> s;
- }
- bool Check(string s)
- {
- vector<int> first(30, 0), last(30, 0);
- s = " " + s;
- for (int i = 1; i < (int)s.size(); ++i)
- {
- if (!first[s[i] - 'A'])
- first[s[i] - 'A'] = i;
- last[s[i] - 'A'] = i;
- }
- for (int i = 0; i < 26; ++i)
- if (first[i] != last[i]) // Chữ cái thứ i xuất hiện nhiều hơn 1 lần
- return false;
- return true;
- }
- void Solve()
- {
- int ans(0), pos(0);
- for (int i = 0; i < (int)s.size(); ++i)
- for (int j = i + ans; j < (int)s.size(); ++j) // Chúng ta chỉ cần duyệt các xâu độ dài > ans
- if (Check(s.substr(i, j - i + 1)))
- {
- ans = j - i + 1;
- pos = i + 1;
- }
- cout << pos << " " << ans;
- }
- int32_t main()
- {
- ios::sync_with_stdio(0);
- cin.tie(0);
- cout.tie(0);
- if (fopen(task ".INP", "r"))
- {
- freopen(task ".INP", "r", stdin);
- freopen(task ".OUT", "w", stdout);
- }
- Read();
- Solve();
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement