no zuo no die

Posted 2020-10-09 Hzoi_Maple

 1 #include <iostream>
 2 #include <cstring>
 3 #include <cstdio>
 4 using namespace std;
 5 namespace Dp{//状态转移 
 6     void shudp()/*"树Dp"*/{
 7         cout<<"树Dp"<<endl;{
 8             cout<<"hzoj:800 1040"<<‘ ‘<<"熟练剖分"<<endl;     
 9             cout<<"n2的转移"<<endl; 
10             cout<<endl<<"+++++++++++++"<<endl;
11             cout<<"hzoj:800 1032"<<‘ ‘<<"战争调度"<<endl;
12             cout<<"基于完全二叉树的一个树归"<<endl; 
13             cout<<endl<<"+++++++++++++"<<endl;
14         } 
15     }
16     void zuobiaodp/*"坐标Dp"*/(){
17         cout<<"坐标dp"<<endl;{
18         } 
19     }
20     void qujiandp/*"区间Dp"*/(){
21         cout<<"区间dp"<<endl;{
22         } 
23     } 
24     void xianxingdp/*"线性Dp"*/(){
25         cout<<"线性dp"<<endl;{
26         }
27     }
28     void beibaodp/*"背包dp"*/(){
29         cout<<"背包dp"<<endl;{
30         } 
31     }
32     void youxuadp/*"优化Dp"*/(){
33         cout<<"数据结构优化Dp"<<endl;{
34         }
35     }
36     void zhuangyadp/*状压dp*/(){
37         cout<<"状压dp"<<endl;{
38         }
39     } 
40 }
41 namespace erfen{//二分 
42 }
43 namespace math{//数论 
44     void gcd()/*最大公约数*/{
45         cout<<"最大公约数"<<endl;{
46         }     
47     }
48     void phi()/*欧拉函数*/{
49         cout<<"欧拉函数"<<endl;{
50         } 
51     }
52     void cart()/*卡特兰数*/{
53         cout<<"卡特兰数"<<endl;{
54             cout<<"hzoj:800 1030"<<‘ ‘<<"网格"<<endl; 
55             cout<<"神奇的打表找规律，以及废掉的高精"<<endl; 
56             cout<<endl<<"+++++++++++++"<<endl;
57         } 
58     }
59     void task4(){
60     }
61     void task5(){
62     }
63     void task6(){
64     }
65 }
66 namespace tulun{//图论 
67 }
68 namespace matrix{//矩阵 
69     void jzksm()/*矩阵优化dp*/{ 
70         cout<<"矩阵"<<endl;{
71             cout<<"hzoj:800 1000"<<‘ ‘<<"随"<<endl;
72             cout<<"达哥出的题,通过源根构造初始矩阵"<<endl;
73             cout<<endl<<"+++++++++++++"<<endl;
74         } 
75     } 
76 }
77 namespace shujujiegou{
78     void zhuxishu()/*主席树*/{
79         cout<<"主席树"<<endl;{
80             cout<<"cogs 930"<<‘ ‘<<" 找第k小的数"<<endl;
81             cout<<"一道水题，板子"<<endl; 
82             cout<<endl<<"+++++++++++++"<<endl;
83             cout<<"cogs 1827"<<‘ ‘<<"快递员"<<endl; 
84             cout<<"稍有变形，依旧很水"<<endl;
85              cout<<endl<<"+++++++++++++"<<endl;
86             cout<<"cogs 2554"<<‘ ‘<<"可持久化线段树"<<endl;
87             cout<<"最值线段树"<<endl; 
88             cout<<endl<<"+++++++++++++"<<endl;
89         }
90     } 
91 }
92 int main(){
93     shujujiegou::zhuxishu();
94     return 0;
95 }

View Code