A. As Simple as One and Two:题目
思路:删去中间
#include <bits/stdc++.h>
using namespace std;
#define int long long
vector<int> a((int)6e5);
vector<int> b((int)6e5), c((int)6e5);
const int mod = 1e9 + 7;
string s;
signed main()
{int t;cin>>t;while (t--){int cnt = 0;cin>>s;int n = s.length();for (int i=0;i<n-2;i++){if((s[i]=='t'&&s[i+1]=='w'&&s[i+2]=='o'&&s[i+3]=='n'&&s[i+4]=='e')){s[i+2]='%';a[cnt++] = i+3;}else if((s[i]=='t'&&s[i+1]=='w'&&s[i+2]=='o')||(s[i]=='o'&&s[i+1]=='n'&&s[i+2]=='e')){s[i+1] ='%';a[cnt++] = i+2;}}cout<<cnt<<endl;for (int i=0;i<cnt;i++) cout<<a[i]<<" ";cout<<endl;}
}