3663顺序表应用4-2:元素位置互换之逆置算法(数据改进)
#include<iostream>
#include<cstdlib>
#define MAX 1100010//注意大小
#define OVERFLOW -1
using namespace std;
int q ;
typedef struct
{
int *elem1,*elem2,*elem3;
int listlen1;
int listsize1;
}list;
void CreatList(list &l,int n)
{
l.elem1=new int [MAX];
for(int i=0;i<n;i++)
{
cin>>l.elem1[i];
}
}
int Change(list &l,int le,int ri)
{
int k,i;
for(i=le;i<((le+ri)+1)/2;i++)//+1不能少
{
k=l.elem1[i];
l.elem1[i]=l.elem1[le+ri-i];
l.elem1[ri+le-i]=k;
}
}
int main()
{
std::ios_base::sync_with_stdio(false);
std::cin.tie(0);
int len,m,t,k,n,i;
cin>>n;
list newlist;
CreatList(newlist,n);
cin>>m;
while(m--)
{
cin>>k;
Change(newlist,0,n-1);
Change(newlist,0,n-k-1);
Change(newlist,n-k,n-1);
for(i=0;i<n;i++)
if(i!=n-1)
cout<<newlist.elem1[i]<<" ";
else cout<<newlist.elem1[n-1]<<endl;
}
return 0;
}