1 solutions

  • 0
    @ 2025-12-9 16:04:04

    C++ :

    #include<bits/stdc++.h>
    using namespace std;
    int n,a[100000+5],b[100000+5],t1,t2,mx1,mx2; 
    int main(){
    //	freopen("10.in","r",stdin);
    //	freopen("10.out","w",stdout);
        cin>>n;
        for(int i=1;i<=n;i++)
            cin>>a[i];
        for(int i=1;i<=n;i++)
            cin>>b[i];
        n++;
        a[n]=0;b[n]=0;
        for(int i=1;i<=n;i++)
            if(a[i]>=20) t1++;
            else{
            	if(t1>mx1) mx1=t1;
            	t1=0;
            }
        for(int i=1;i<=n;i++)
            if(b[i]>=20) t2++;
            else{
            	if(t2>mx2) mx2=t2;
            	t2=0;
            }
        if(mx1>mx2) cout<<"Xiaoli "<<mx1;
        if(mx1<mx2) cout<<"Xiaowang "<<mx2;
        if(mx1==mx2) cout<<"Tie "<<mx1;
        return 0;
    }
    
    
    • @ 2025-12-11 17:28:07
      
      #include<bits/stdc++.h>
      using namespace std;
      long long f(vector<long long>&v){
          long long m=0,c=0;
          for(int i=0;i<v.size();i++){
              c=v[i]>=20?c+1:0;
              m=c>m?c:m;
          }
          return m;
      }
      
      int main(){
          int n;
          cin>>n;
          vector<long long>a(n),b(n);
          for(int i=0;i<n;i++)cin>>a[i];
          for(int i=0;i<n;i++)cin>>b[i];
          long long l=f(a),w=f(b);
          cout<<(l>w?"Xiaoli ":w>l?"Xiaowang ":"Tie ")<<(l>w?l:w);
          return 0;
      }
      
      
  • 1

Information

ID
1020
Time
1000ms
Memory
128MiB
Difficulty
6
Tags
(None)
# Submissions
17
Accepted
11
Uploaded By