STL总结

将学习过程中遇到的不会的STL用法记录

 1、二维vector避免MLE

 

#include<bits/stdc++.h>
using namespace std;
const int maxn = 10010;
vector<int> mapp[maxn];//就像邻接表存储树的结构一样
int value[maxn];
int root_value[maxn];
int dfs(int k, int father) 
{
	for (int i = 0; i < mapp[k].size(); i++) 
	{
		int t = mapp[k][i];
		if (t == father) continue;
		root_value[k] += dfs(t, k);
	}
	root_value[k] += value[k];
	return root_value[k];
}
int main() 
{
	int n, m;
	scanf("%d%d", &n, &m);
	for (int i = 1; i <= n; i++)
		scanf("%d", &value[i]);
	for (int i = 0; i < n - 1; i++) 
	{
		int a, b;
		scanf("%d%d", &a, &b);
		mapp[a].push_back(b);
		mapp[b].push_back(a);
	}
	dfs(1, 0);
	int x;
	while (m--) 
	{
		scanf("%d", &x);
		printf("%d\n", root_value[x]);
	}
	return 0;
}

注：vector<int> mapp[maxn]就相当于邻接表存储树的结构，邻接矩阵会MLE