DP最长链
不会证明的玄学题。
我们令每个三角形变成一个点,相邻三角形连边,一定是构成一棵树(如果有环,那么中间就会有端点,显然不行)
然后就跑最长链了(不会证明)
#include<cstdio>
#include<algorithm>
#include<map>
#define N 200005
using namespace std;
map<pair<int,int>,int> mapp;
struct edge{int next,to;}e[N<<1];
int ecnt=1, mcnt=0, f[N][3], last[N], side[N<<1][3], mx1[N], mx2[N], ans=0;
void addedge(int a, int b)
{
e[++ecnt]=(edge){last[a],b};
last[a]=ecnt;
}
void dfs(int x, int fa)
{
for(int i = last[x]; i; i=e[i].next)
{
int y = e[i].to;
if(y==fa)continue;
dfs(y,x);
int tmp = mx1[y]+1;
if(tmp > mx1[x])mx2[x]=mx1[x],mx1[x]=tmp;
else if(tmp > mx2[x])mx2[x]=tmp;
}
if(ans < mx1[x]+mx2[x]+1)ans = mx1[x]+mx2[x]+1;
}
int main()
{
int n;
scanf("%d",&n);
for(int i = 1; i <= n; i++)
{
scanf("%d%d%d",&f[i][0],&f[i][1],&f[i][2]);
for(int j = 0; j <= 2; j++)
for(int k = 0; k <= 2; k++)
if(f[i][j] < f[i][k])
{
int pos;
if(!mapp[make_pair(f[i][j], f[i][k])])pos = mapp[make_pair(f[i][j], f[i][k])] = ++mcnt;
else pos = mapp[make_pair(f[i][j],f[i][k])];
side[pos][++side[pos][0]] = i;
}
}
for(int i = 1; i <= mcnt; i++)
if(side[i][0] == 2)
{
addedge(side[i][1],side[i][2]);
addedge(side[i][2],side[i][1]);
}
dfs(1,0);
printf("%d\n",ans);
}