给我一个一个基于C语言实现的页面置换算法程序，支持最佳置换算法OPT、的代码

以下是一个基于C语言实现的页面置换算法程序，支持最佳置换算法OPT：

#include <stdio.h>

#define MAX_PAGE_NUM 100
#define MAX_PAGE_REF_NUM 1000

int page_seq[MAX_PAGE_REF_NUM]; // 页面引用序列
int page_num; // 页面数
int page_ref_num; // 页面引用序列长度

// 获取下一个需要访问的页面的下标
int get_next_page_index(int *pages, int *used, int start_index) {
    int next_index = -1;
    int i;
    for (i = start_index; i < page_ref_num; i++) {
        if (used[page_seq[i]] == 0) {
            next_index = i;
            break;
        }
    }
    if (next_index == -1) {
        int max_distance = -1;
        int j;
        for (j = 0; j < page_num; j++) {
            if (used[pages[j]] == 0) {
                return j;
            }
            int k;
            for (k = i; k < page_ref_num; k++) {
                if (page_seq[k] == pages[j]) {
                    if (k - i > max_distance) {
                        max_distance = k - i;
                        next_index = j;
                    }
                    break;
                }
            }
            if (k == page_ref_num) {
                return j;
            }
        }
    }
    return next_index;
}

// OPT页面置换算法
int opt_page_replacement_algorithm() {
    int pages[MAX_PAGE_NUM];
    int used[MAX_PAGE_NUM] = {0};
    int i, j, page_fault_count = 0;
    for (i = 0; i < page_num; i++) {
        pages[i] = -1;
    }
    for (i = 0; i < page_ref_num; i++) {
        int next_index = -1;
        for (j = 0; j < page_num; j++) {
            if (pages[j] == page_seq[i]) {
                used[page_seq[i]] = 1;
                next_index = -1;
                break;
            } else if (pages[j] == -1) {
                next_index = j;
            }
        }
        if (next_index != -1) {
            pages[next_index] = page_seq[i];
            used[page_seq[i]] = 1;
            page_fault_count++;
        } else if (next_index == -1) {
            next_index = get_next_page_index(pages, used, i + 1);
            pages[next_index] = page_seq[i];
            used[page_seq[i]] = 1;
            page_fault_count++;
        }
    }
    return page_fault_count;
}

int main() {
    printf("请输入页面数和页面引用序列长度，以空格分隔：\n");
    scanf("%d %d", &page_num, &page_ref_num);
    printf("请输入页面引用序列，以空格分隔：\n");
    int i;
    for (i = 0; i < page_ref_num; i++) {
        scanf("%d", &page_seq[i]);
    }
    int page_fault_count = opt_page_replacement_algorithm();
    printf("页面缺页次数：%d\n", page_fault_count);
    return 0;
}