1. 程式人生 > >no zuo no die

no zuo no die

col clu adp cout style phi std +++ code

技術分享
 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

no zuo no die