![](https://img-blog.csdnimg.cn/20201014180756757.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
邻接表深度优先遍历
文章平均质量分 52
Lndulge.
一个蒟蒻 OIer
还在努力中 noip加油!
这个博客用来记录笔记和做的题。。
展开
-
[笔记]:指针 链表 邻接表
1.指针#include<iostream> #include<cstdio> #include<cstring> #include<cstdlib> #include<algorithm> #include<cmath> using namespace std; int main(){ int a; scanf("%d",&a); int *b; *b=a;原创 2017-05-16 15:28:36 · 621 阅读 · 0 评论 -
[poj 3321]:Apple Tree(树状数组/线段树 和dfs序)
Apple Tree Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 29084 Accepted: 8633 Description There is an apple tree outside of kaka’s house. Every autumn, a lot of apples wi原创 2017-05-24 14:08:59 · 1141 阅读 · 0 评论