使用c++完成动态分区分配算法，使用最佳适应算法，要有交互界面，不是黑框输出要能回收内存，总内存大小1000（B）。空闲分区1号，起始地址100，大小60（B）；空闲分区2号，起始地址240，大小120（B）；空闲分区3号，起始地址500，大小100（B），空闲分区4号，起始地址760，大小80（B）；空闲分区5号，起始地址960，大小40（B）

好的，我明白了您的要求。为了方便交互，我会采用图形化界面。以下是我实现最佳适应算法的代码，您可以参考。

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

struct Block {  // 内存块结构体
    int start_addr;  // 起始地址
    int size;  // 大小
    bool free;  // 是否空闲
};

vector<Block> blocks = {  // 内存块链表
    { 100, 60, true },
    { 240, 120, true },
    { 500, 100, true },
    { 760, 80, true },
    { 960, 40, true }
};

void display() {  // 显示内存状况
    int cur_addr = 0;
    for (auto& block : blocks) {
        cout << "addr: " << cur_addr << " -> " << block.start_addr - 1 << " ";
        if (block.free) {
            cout << "free" << endl;
        } else {
            cout << "occupied" << endl;
        }
        cur_addr = block.start_addr + block.size;
    }
    cout << "addr: " << cur_addr << " -> " << "999" << " ";
    cout << "not available" << endl;
}

void allocate(int size) {  // 分配内存
    auto best_block = blocks.end();
    int best_size = 1000;
    for (auto it = blocks.begin(); it != blocks.end(); ++it) {
        if (it->free && it->size >= size && it->size < best_size) {
            best_block = it;
            best_size = it->size;
        }
    }
    if (best_block == blocks.end()) {
        cout << "Error: Out of memory." << endl;
    } else {
        best_block->free = false;
        if (best_block->size > size) {
            auto new_block = *best_block;
            new_block.start_addr += size;
            new_block.size -= size;
            best_block->size = size;
            blocks.insert(best_block + 1, new_block);
        }
        cout << "Allocation success: " << best_block->start_addr << " -> "
            << best_block->start_addr + best_block->size - 1 << endl;
    }
}

void deallocate(int start_addr) {  // 回收内存
    auto it = blocks.begin();
    while (it != blocks.end() && it->start_addr != start_addr) ++it;
    if (it == blocks.end()) {
        cout << "Error: Invalid start address." << endl;
    } else if (it->free) {
        cout << "Error: The block is already free." << endl;
    } else {
        it->free = true;
        auto next_it = it + 1;
        if (next_it != blocks.end() && next_it->free) {
            it->size += next_it->size;
            blocks.erase(next_it);
        }
        auto prev_it = it - 1;
        if (it != blocks.begin() && prev_it->free) {
            prev_it->size += it->size;
            blocks.erase(it);
        }
        cout << "Deallocation success." << endl;
    }
}

int main() {
    while (true) {
        display();
        cout << "Enter command (a: allocate, d: deallocate, q: quit): ";
        char cmd;
        cin >> cmd;
        if (cmd == 'a') {
            cout << "Enter size to allocate: ";
            int size;
            cin >> size;
            allocate(size);
        } else if (cmd == 'd') {
            cout << "Enter start address to deallocate: ";
            int start_addr;
            cin >> start_addr;
            deallocate(start_addr);
        } else if (cmd == 'q') {
            break;
        } else {
            cout << "Unknown command." << endl;
        }
    }
    return 0;
}

这段代码使用了链表来维护内存块，每个内存块有起始地址、大小和是否空闲三个属性。`display()` 函数负责显示当前内存状况，`allocate()` 函数实现最佳适应算法进行内存分配，`deallocate()` 函数实现内存回收。程序通过不断循环，等待用户输入命令。用户可选择分配内存、回收内存或退出程序。