使用c或者c++完成动态分区分配算法编写，要有交互界面

好的，我了解了您的要求。对于动态分区分配算法，通常采用的是首次适应算法或最佳适应算法。下面我将用C++编写一个交互式的动态分区分配算法程序，采用首次适应算法。

#include <iostream>
#include <vector>

using namespace std;

struct Partition {
    int pid;
    int start_addr;
    int size;
    bool used;
};

vector<Partition> partitions;

void init_memory(int size) {
    Partition p;
    p.pid = -1;
    p.start_addr = 0;
    p.size = size;
    p.used = false;
    partitions.push_back(p);
}

void print_partitions() {
    cout << "Partition table: " << endl;
    for (int i = 0; i < partitions.size(); i++) {
        cout << "Partition " << i + 1 << ": ";
        if (partitions[i].used) {
            cout << "PID " << partitions[i].pid << " ";
        } else {
            cout << "Free space ";
        }
        cout << partitions[i].size << "KB" << endl;
    }
}

void allocate_partition(int pid, int size) {
    for (int i = 0; i < partitions.size(); i++) {
        if (!partitions[i].used && partitions[i].size >= size) {
            Partition p;
            p.pid = pid;
            p.start_addr = partitions[i].start_addr;
            p.size = size;
            p.used = true;
            partitions[i].start_addr += size;
            partitions[i].size -= size;
            partitions.insert(partitions.begin() + i, p);
            cout << "Allocate partition " << i + 1 << " for PID " << pid << endl;
            return;
        }
    }
    cout << "Cannot allocate partition for PID " << pid << endl;
}

void free_partition(int pid) {
    for (int i = 0; i < partitions.size(); i++) {
        if (partitions[i].used && partitions[i].pid == pid) {
            partitions[i-1].size += partitions[i].size;
            partitions.erase(partitions.begin() + i);
            cout << "Free partition for PID " << pid << endl;
            return;
        }
    }
    cout << "Cannot find partition for PID " << pid << endl;
}

int main() {
    int memory_size;
    cout << "Please enter memory size: ";
    cin >> memory_size;
    init_memory(memory_size);

    while (true) {
        print_partitions();
        int choice;
        cout << "Please select operation: 1. Allocate partition 2. Free partition 3. Exit" << endl;
        cin >> choice;
        if (choice == 1) {
            int pid, size;
            cout << "Please enter PID and size: ";
            cin >> pid >> size;
            allocate_partition(pid, size);
        } else if (choice == 2) {
            int pid;
            cout << "Please enter PID: ";
            cin >> pid;
            free_partition(pid);
        } else if (choice == 3) {
            break;
        }
    }

    return 0;
}

这个程序实现了动态分区分配算法的基本功能，包括初始化内存、分配分区、释放分区等。用户可以通过菜单选择需要执行的操作。在分配分区时，采用了首次适应算法，寻找第一个能够容纳所需大小的空闲分区进行分配。

您可以根据需要对程序进行扩展，比如加入最佳适应算法、循环首次适应算法等。同时，您可以使用图形界面库如Qt或者MFC等来实现更友好的交互界面。