逆置将排在前面n个和后面的m个逆置

#include<bits/stdc++.h>
using namespace std;
#define max 50
struct sqlist{
int a[max]={1,2,3,4,5,6,7};
int length=7;
};
void reverse(sqlist &s,int l,int r)
{
int t=0;
for(int i=l;i<=(l+r)/2;i++)
{
t=s.a[i];
s.a[i]=s.a[l+r-i];
s.a[l+r-i]=t;
}
}

void change(sqlist &s,int m,int n)
{
reverse(s,0,n+m-1);
cout<<“整体逆置”<<endl;
for(int i=0;i<s.length;i++)
cout<<s.a[i]<<" ";
cout<<endl;
reverse(s,0,n-1);
cout<<“前n个逆置”<<endl;

for(int i=0;i<s.length;i++)
cout<<s.a[i]<<" ";
cout<<endl;
reverse(s,n,m+n-1); 
cout<<"后n个逆置"<<endl;
reverse(s,0,m+n-1);

for(int i=0;i<s.length;i++)
cout<<s.a[i]<<" ";
cout<<endl;

}
int main()
{
sqlist s;
change(s,3,4);
}