#include <bits/stdc++.h>
#include "friend.h"
#define mp make_pair
#define mt make_tuple
#define ff first
#define ss second
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const ll INFL = (1LL<<62)-1;
const int INF = (1<<30)-1;
const int MAXN = 0;
int findSample(int n, int confidence[], int host[], int protocol[]){
vector<vector<bool>> isFriend(n, vector<bool> (n,0));
for(int i = 1; i < n; i++){
for(int j = 0; j < n; j++){
isFriend[j][i] = isFriend[host[i]][j] && protocol[i];
isFriend[i][j] = isFriend[j][i];
}
if(protocol[i] == 0 || protocol[i] == 2)
isFriend[host[i]][i] = 1, isFriend[i][host[i]] = 1;
}
vector<int> dp(n,0);
int resp = 0;
for(int i = n-1; i >= 0; i--){
for(int j = i+1; j < n; j++){
if(!isFriend[i][j])
dp[i] = max(dp[j],dp[i]);
}
dp[i]+=confidence[i];
resp = max(resp,dp[i]);
}
return resp;
}
