题解但整活向

#include<bits/stdc++.h>
using namespace std;
int main(){
    int cnt=0,n=0,first=-1;
    string s1,s2;
    getline(cin,s1);
    getline(cin,s2);
    s2 += ' ';
    int i = -1;
    for_:
        i++;
        //cout<<cnt << ' ' << s2[i]<<endl;
        if(s2[i]==s1[cnt] || s2[i]-32 == s1[cnt] || s2[i]-32 == s1[cnt] || s2[i]-32 == s1[cnt]-32){
            cnt++;
        }
        else{
            cnt=0;
        }
        //if(cnt == s1.size()){
        //    cout<<i<<endl;
        //}
        if(cnt == s1.size() &&s2[i+1]==' '){
            //cout<<cnt <<' '<<i<<endl;
            bool b = 0;
            if(i+1-cnt==0){
                n++;
                b = 1;    
                //return 0;
            }
            else if(s2[i-cnt]==' '){
                n++;
                b = 1;
                //return 0;
            }
            if(b&&n==1){
                first = i+1-cnt; 
            }
        }
        // else if(cnt == s1.size()-1){
        //     cnt = 0;
        // }
        if(i<s2.size()-1)goto for_;
    
    if(n){
        cout<< n <<' '<<first;
    }
    else cout<<-1; 
}