/* * Author: Nonoze * Created: Saturday 13/12/2025 */ #include <bits/stdc++.h> using namespace std; #ifndef DEBUG #define dbg(...) #endif // #define cout cerr << "OUT: " #define endl '\n' #define endlfl '\n' << flush #define quit(x) return (void)(cout << x << endl) template<typename T> void read(T& x) { cin >> x; } template<typename T1, typename T2> void read(pair<T1, T2>& p) { read(p.first), read(p.second); } template<typename T> void read(vector<T>& v) { for (auto& x : v) read(x); } template<typename T1, typename T2> void read(T1& x, T2& y) { read(x), read(y); } template<typename T1, typename T2, typename T3> void read(T1& x, T2& y, T3& z) { read(x), read(y), read(z); } template<typename T1, typename T2, typename T3, typename T4> void read(T1& x, T2& y, T3& z, T4& zz) { read(x), read(y), read(z), read(zz); } template<typename T> void print(vector<T>& v) { for (auto& x : v) cout << x << ' '; cout << endl; } #define sz(x) (int)(x.size()) #define all(x) (x).begin(), (x).end() #define rall(x) (x).rbegin(), (x).rend() #define make_unique(v) sort(all(v)), v.erase(unique(all(v)), (v).end()) #define pb push_back #define mp(a, b) make_pair(a, b) #define fi first #define se second #define cmin(a, b) a = min(a, b) #define cmax(a, b) a = max(a, b) #define YES cout << "YES" << endl #define NO cout << "NO" << endl #define QYES quit("YES") #define QNO quit("NO") #define int long long #define double long double const int inf = numeric_limits<int>::max() / 4; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); const int MOD = 1e9+7, LOG=20; void solve(); signed main() { ios::sync_with_stdio(0); cin.tie(0); int tt=1; // cin >> tt; while(tt--) solve(); return 0; } int n, k, m, q; vector<vector<int>> adj; vector<int> dfs(int u) { vector<vector<int>> child_paths; for (auto& v : adj[u]) { child_paths.pb(dfs(v)); } if (child_paths.empty()) { return {1}; } sort(all(child_paths), [](auto& a, auto& b) { return sz(a) < sz(b); }); vector<int> path; swap(path, child_paths.back()); int nnode=1; if (sz(path)>=k) nnode+=path[sz(path)-k]; path.pb(nnode); for (auto &cp: child_paths) if (!cp.empty()){ int kmx=0; vector<pair<int, int>> modifs; for (int x=sz(cp)-1; x>=0 && sz(cp)-x<=k; x--){ int nb=sz(cp)-x; int left=k-nb+1; modifs.pb({sz(path)-min(nb+1, left), cp[x]+(sz(path)>=left?(path[sz(path)-left]):0)}); } for (int x=0; x<sz(cp); x++){ int nb=sz(cp)-x; if (sz(path)-max(nb+1, k-nb+1)>=0) modifs.pb({sz(path)-nb-1, path[sz(path)-max(nb+1, k-nb+1)]+cp[x]}); } for (auto &[pos, val]: modifs) { cmax(path[pos], val); } for (int x=sz(cp)-1; x>=0; x--) { int val=sz(path)-1-x; if (val-1>=0) cmax(path[val], path[val-1]); } } dbg(u, path); return path; } void solve() { read(n, k); adj.clear(), adj.resize(n); for (int i=1; i<n; i++) { int x; cin >> x; adj[x].pb(i); } auto res = dfs(0); cout << *max_element(all(res)) << endl; }