c语言同时在一个项目完成最佳置换 optimal policy 和最近最久未用算法 LRU 。要求输入内存物理块 frame 个数和页面访问序列，结果输出：页面置换过程和缺页次数。

以下是实现最佳置换算法和最近最久未使用算法的 C 语言代码，可以满足你的要求：

#include <stdio.h>
#include <stdlib.h>

// 最佳置换算法
int optimal(int pages[], int n, int capacity) {
    int pageFaults = 0;
    int *frames = (int *)malloc(capacity * sizeof(int));
    int i, j, k, max, pos;
    for (i = 0; i < capacity; i++) {
        frames[i] = -1;
    }
    for (i = 0; i < n; i++) {
        int pageFound = 0;
        for (j = 0; j < capacity; j++) {
            if (frames[j] == pages[i]) {
                pageFound = 1;
                break;
            }
        }
        if (!pageFound) {
            pageFaults++;
            int *future = (int *)malloc(capacity * sizeof(int));
            for (j = 0; j < capacity; j++) {
                future[j] = -1;
                for (k = i + 1; k < n; k++) {
                    if (frames[j] == pages[k]) {
                        future[j] = k;
                        break;
                    }
                }
            }
            int replace = 0;
            for (j = 0; j < capacity; j++) {
                if (future[j] == -1) {
                    replace = j;
                    break;
                }
                if (future[j] > future[replace]) {
                    replace = j;
                }
            }
            frames[replace] = pages[i];
            free(future);
        }
    }
    free(frames);
    return pageFaults;
}

// 最近最久未使用算法
int LRU(int pages[], int n, int capacity) {
    int pageFaults = 0;
    int *frames = (int *)malloc(capacity * sizeof(int));
    int *counter = (int *)malloc(capacity * sizeof(int));
    int i, j, k, min, pos;
    for (i = 0; i < capacity; i++) {
        frames[i] = -1;
    }
    for (i = 0; i < n; i++) {
        int pageFound = 0;
        for (j = 0; j < capacity; j++) {
            if (frames[j] == pages[i]) {
                pageFound = 1;
                counter[j] = 0;
                break;
            }
        }
        if (!pageFound) {
            pageFaults++;
            int replace = 0;
            for (j = 0; j < capacity; j++) {
                if (counter[j] > counter[replace]) {
                    replace = j;
                }
            }
            frames[replace] = pages[i];
            counter[replace] = 0;
        }
        for (j = 0; j < capacity; j++) {
            if (frames[j] != -1) {
                counter[j]++;
            }
        }
    }
    free(frames);
    free(counter);
    return pageFaults;
}

int main() {
    int capacity, n, i;
    printf("Enter the number of frames: ");
    scanf("%d", &capacity);
    printf("Enter the number of pages: ");
    scanf("%d", &n);
    int *pages = (int *)malloc(n * sizeof(int));
    printf("Enter the page reference string: ");
    for (i = 0; i < n; i++) {
        scanf("%d", &pages[i]);
    }
    printf("\nOptimal Page Replacement Algorithm:\n");
    int pageFaultsOptimal = optimal(pages, n, capacity);
    printf("Page Faults: %d\n", pageFaultsOptimal);
    printf("\nLRU Page Replacement Algorithm:\n");
    int pageFaultsLRU = LRU(pages, n, capacity);
    printf("Page Faults: %d\n", pageFaultsLRU);
    free(pages);
    return 0;
}

运行程序后，会要求输入内存物理块 frame 个数和页面访问序列，然后输出最佳置换算法和最近最久未使用算法的页面置换过程和缺页次数。