树上半径k最小覆盖

洛谷的p2279

#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
const int maxn = 2007;
const int inf = 0x3f3f3f3f;
int d[maxn], f[maxn], b[maxn], o[maxn]; //d 深度 f 父结点 b 深度排序顺序 o 距离覆盖中心多远
int n;
const int k = 2; //k 范围覆盖
int v[k + 1]; //当前节点往上k代
int ans = 0;
bool cmp(int x, int y)
{
    return d[x] > d[y];
}
int main()
{
    scanf("%d", &n);
    for(int i = 1; i <= n; i ++)
    {
        b[i] = i;
        o[i] = inf;
    }
    for(int i = 2; i <= n; i ++) //处理结点 深度
    {
        scanf("%d", &f[i]);
        d[i] = d[f[i]] + 1;
    }
    sort(b + 1, b + n + 1, cmp); //深度大到小
    for(int i = 1; i <= n; i ++)
    {
        v[0] = b[i];
        for(int i = 1; i <= k; i ++)
        {
            v[i] = f[v[i - 1]];
            o[v[0]] = min( o[v[0]], o[v[i]] + i);
        }
        if(o[v[0]] > k)
        {
            o[v[k]] = 0;
            ans ++;
            int u = v[k];
            for(int i = 1; i <= k; i ++)
            {
                o[f[u]] = min(o[f[u]], i);
                u = f[u];
            }
        }
    }
    printf("%d", ans);

}