如何使算法复杂化

lyhldy CSP-J2二等 2024-08-05 15:46:45 5

用队列

int t = q.front();
    q.pop();
    q.push(t);
    while (!q.empty()) {
        printf("%d ", q.front());
        q.pop();
    }
{{ vote && vote.total.up }}