60pts TLE 求优化

#include<bits/stdc++.h>
using ll = long long;
using namespace std;

signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	
	string s;
	cin >> s;
	int n = s.length();
	
	vector<int> d;
	d.push_back(-1);
	
	for (int i = 0; i < n; i++) {
		if (s[i] == '.') d.push_back(i);
	}
	d.push_back(n);
	vector<int> m;
	for (int i = 1; i < n; i++) {
		int ld = -1;
		for (int j = 0; j < d.size(); j++) {
			if (d[j] > i) break;
			ld = d[j];
		}
		int l = i - ld;
		if (l != 3 && l != 2) continue;
		bool f = 1;
		string tar;
		if (l == 3) tar = "edu";
		else tar = "cn";
		for (int k = 0; k < l; k++) {
			char c = s[ld + 1 + k];
			if (isalpha(c)) c = tolower(c);
			if (c != tar[k]) {
				f = 0;
				break;
			}
		}
		if (!f) continue;
		int pd = -1;
		for (int j = 0; j < d.size(); j++) {
			if (d[j] >= ld) break;
			pd = d[j];
		}
		if (pd == -1) continue;
		int pl = ld - pd - 1;
		if (pl != 3) continue;
		
		bool f2 = 1;
		for (int k = 0; k < 3; k++) {
			char c = s[pd + 1 + k];
			if (isalpha(c)) c = tolower(c);
			if (c != 'e' && c != 'd' && c != 'u') {
				f2 = 0;
				break;
			}
		}
		if (f2) m.push_back(i + 1);
	}
	for (int i : m) cout << i << ' ';
	return 0;
}