用C++编写一个算法，能够实现将顺序表中原来在前m个元素放到表的后段，后length-m个元素放到表的前段。

#include <stdio.h>

#define MAXSIZE 100

typedef struct {
    int data[MAXSIZE];
    int length;
} SqList;

void reverse(SqList *L, int m) {
    int i, j, temp;
    for (i = m, j = L->length - 1; i < j; i++, j--) {
        temp = L->data[i];
        L->data[i] = L->data[j];
        L->data[j] = temp;
    }
    for (i = 0, j = m - 1; i < j; i++, j--) {
        temp = L->data[i];
        L->data[i] = L->data[j];
        L->data[j] = temp;
    }
    for (i = 0, j = L->length - 1; i < j; i++, j--) {
        temp = L->data[i];
        L->data[i] = L->data[j];
        L->data[j] = temp;
    }
}

int main() {
    SqList L = {{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}, 10};
    int m = 5;
    int i;
    printf("Original List: ");
    for (i = 0; i < L.length; i++) {
        printf("%d ", L.data[i]);
    }
    printf("\n");
    reverse(&L, m);
    printf("Reversed List: ");
    for (i = 0; i < L.length; i++) {
        printf("%d ", L.data[i]);
    }
    printf("\n");
    return 0;
}