id陷阱【自用】

id陷阱

代码一

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

typedef struct Node
{
  int id;
  vector<int> neighbors;
} Node;

struct cmp
{
  bool operator()(const Node &a, const Node &b)
  {
    return a.neighbors.size() < b.neighbors.size();
  }
};

const int MAXN = 3e5 + 9;
int n = 0, m = 0;

Node nodes[MAXN];

void print()
{
  for (int i = 0; i < n; i++)
  {
    cout << i << "::";
    for (int t : nodes[i].neighbors)
      cout << t << " ";
    cout << endl;
  }
}

void slove()
{
  cin >> n >> m;
  for (int i = 0; i < n; i++)
  {
    nodes[i].id = i;
  }

  for (int i = 0; i < m; i++)
  {
    int a, b;
    cin >> a >> b;
    nodes[a].neighbors.push_back(b);
    nodes[b].neighbors.push_back(a);
  }
  print();
  sort(nodes, nodes + n, cmp());
  print();

  int dep[MAXN];
  for (int i = 0; i < MAXN; i++)
    dep[i] = 1;
  for (int i = 0; i < n; i++)
  {
    int n = nodes[i].id;
    for (int t : nodes[n].neighbors)
    {
      if (nodes[n].neighbors.size() < nodes[t].neighbors.size())
        dep[t] = max(dep[t], dep[i] + 1);
    }
    cout << "**********************" << endl;

    for (int i = 0; i < n; i++)
    {
      cout << i << ":" << dep[i] << " " << endl;
    }
    cout << "**********************" << endl;
  }
  int res = 0;
  for (int i = 0; i < n; i++)
    res = max(dep[i], res);
  cout << res << endl;
}

int main()
{
  slove();
  system("pause");
  return 0;
}

代码二

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

typedef struct Node
{
  vector<int> neighbors;
} Node;

struct cmp
{
  bool operator()(const Node &a, const Node &b)
  {
    return a.neighbors.size() < b.neighbors.size();
  }
};

const int MAXN = 3e5 + 9;
int n = 0, m = 0;

Node nodes[MAXN];

void print()
{
  for (int i = 0; i < n; i++)
  {
    cout << i << "::";
    for (int t : nodes[i].neighbors)
      cout << t << " ";
    cout << endl;
  }
}

void slove()
{
  cin >> n >> m;
  for (int i = 0; i < n; i++)
  {
    nodes[i].id = i;
  }

  for (int i = 0; i < m; i++)
  {
    int a, b;
    cin >> a >> b;
    nodes[a].neighbors.push_back(b);
    nodes[b].neighbors.push_back(a);
  }
  print();
  sort(nodes, nodes + n, cmp());
  print();

  int dep[MAXN];
  for (int i = 0; i < MAXN; i++)
    dep[i] = 1;
  for (int i = 0; i < n; i++)
  {
    int n = nodes[i].id;
    for (int t : nodes[n].neighbors)
    {
      if (nodes[n].neighbors.size() < nodes[t].neighbors.size())
        dep[t] = max(dep[t], dep[i] + 1);
    }
    cout << "**********************" << endl;

    for (int i = 0; i < n; i++)
    {
      cout << i << ":" << dep[i] << " " << endl;
    }
    cout << "**********************" << endl;
  }
  int res = 0;
  for (int i = 0; i < n; i++)
    res = max(dep[i], res);
  cout << res << endl;
}

int main()
{
  slove();
  system("pause");
  return 0;
}

陷阱点

代码一和代码二的区别在于，struct的定义中是否有id这个属性。如果解决题目时需要id与内容的严格对应的话，需要在结构体中加入id，原因是在对结构体数组进行排序后，原本的下标和内容的对应关系会被打乱。

原本的下标和内容的对应关系：

排序后的下标和内容的对应关系: