head+tail求调（萌新

#include<bits/stdc++.h>
using namespace std;
int main(){
    int n;
    cin>>n;
    int ls[n];
    for(int i=0;i<n;i++){
        cin>>ls[i];
    }
    int ans=0,head=0,tail=1;
    while(tail<n){
        cout<<head<<" "<<tail<<endl;
        if(ls[tail]>ls[head]){
            ans++;
            // cout<<ls[head]<<" "<<ls[tail]<<endl;
            head++;
            tail++;
        }else{
            tail++;
        }
    }
    cout<<n-ans;

return 0;
}