Järjestys

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

long long a,b,n,x,y;
vector<long long>s;
 vector<long long> v;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
    cin >> n;
  for(int i=0; i<n;i++){
      cin>>b;
      v.push_back(b);   
  }
     while(n!=0){
         if(v[0]==1){
             if(is_sorted(v.begin(),v.end()))
                break;
         }
         int k=0;
         if(v[1]==v[0]+1){
             while(v[k+2]!=v[0]-1 && k!=n-1){k++;}
             s.push_back(k+1);
             reverse(v.begin(),v.begin()+(k+1));
     
         }
          else if(v[1]!=v[0]+1){
                 while(v[k+1]!=v[0]+1 && k!=n-1){k++;}
                 s.push_back(k+1);
                 reverse(v.begin(),v.begin()+(k+1));
   
         }
            
            
         else {reverse(v.begin(),v.end());
              s.push_back(n);
           
         }
         
     }
    y=s.size();
cout<<y<<"\n";
for(int i=0; i<y;i++){
    cout<<s[i]<<" ";
     }
}

Test 1

Group: 1

Verdict: RUNTIME ERROR

Test 2

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 3

Group: 3

Verdict: TIME LIMIT EXCEEDED