![](https://img-blog.csdnimg.cn/20201014180756925.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
C/C++
我的指针和我一样已找到对象
退役的ACMer。现在:智能媒体计算、大数据
展开
-
编译器手工开栈(hdu可以其他可以尝试)
转载来源: http://blog.csdn.net/u011644423/article/details/38361111 做题的时候经常遇到深度递归的,当然也可以改成非递归形式。如果写成递归形式会爆栈,所以可以用手工扩展栈。 C++ (一般用C++提交,所以就推荐这种了)//推荐 #pragma comment(linker, "/STACK转载 2015-03-12 17:57:48 · 423 阅读 · 0 评论 -
Matrix Chain Multiplication UVA442 矩阵连乘 stack
题目链接 http://www.bnuoj.com/v3/problem_show.php?pid=17581 Matrix Chain Multiplication Suppose you have to evaluate an expression like A*B*C*D*E where A,B,C,D and E are ma原创 2015-02-16 17:37:12 · 405 阅读 · 0 评论 -
Ugly Numbers UVA 136 priority_queue+set
题目链接 Ugly Numbers Ugly numbers are numbers whose only prime factors are 2, 3 or 5. The sequence 1, 2, 3, 4, 5, 6, 8, 9, 10, 12, 15, ... shows the fi原创 2015-02-16 11:01:59 · 482 阅读 · 0 评论 -
The SetStack Computer UVA12096 STL set map LRJ做法
点击打开链接 #include #include #include #include #include #include #include #define ALL(x) x.begin(),x.end() #define INS(x) inserter(x,x.begin()) using namespace std; typedef setSet; mapIDcache; vector原创 2015-02-15 10:08:55 · 471 阅读 · 0 评论 -
Andy's First Dictionary(uva 10815) set用法
Andy's First Dictionary Time Limit: 3000ms Memory Limit: 131072KB This problem will be judged on UVA. Original ID: 10815 64-bit integer IO format: %lld Java class name: Main Prev原创 2015-02-03 13:46:34 · 1725 阅读 · 0 评论 -
Ananagrams (uva 156,bnu 17295) map用法,单词标准化
点击打开题目链接 Ananagrams Time Limit: 3000ms Memory Limit: 131072KB This problem will be judged on UVA. Original ID: 156 64-bit integer IO format: %lld Java class name: Main P原创 2015-02-06 17:43:38 · 443 阅读 · 0 评论 -
Rails VUA 514 栈的运用,车站调度,
题目链接 Rails There is a famous railway station in PopPush City. Country there is incredibly hilly. The station was built in last century. Unfortunately, funds were extr原创 2015-02-16 12:30:55 · 553 阅读 · 0 评论 -
Team Queue UVA 540 queue+map LRJ做法
点击打开链接 #include #include #include #include using namespace std; const int maxt = 1000+10; int main() { int t,cas=1; while(scanf("%d",&t)&&t!=0){ printf("Scenario #%d\n",cas++);原创 2015-02-15 11:18:16 · 397 阅读 · 0 评论 -
蓝桥杯 地宫取宝 DP
问题描述 X 国王有一个地宫宝库。是 n x m 个格子的矩阵。每个格子放一件宝贝。每个宝贝贴着价值标签。 地宫的入口在左上角,出口在右下角。 小明被带到地宫的入口,国王要求他只能向右或向下行走。 走过某个格子时,如果那个格子中的宝贝价值比小明手中任意宝贝价值都大,小明就可以拿起它(当然,也可以不拿)。 当小明走到出口时,如果他手中的宝贝恰好是原创 2015-04-10 21:29:19 · 582 阅读 · 0 评论 -
bfs Abbott的复仇 UVA 816
#include #include #include #include #include #include #include #include #include #include #include #define LL long long #define INF 0x3f3f3f3f using namespace std; const int N=1000000009; struct Node转载 2015-03-08 15:12:01 · 1442 阅读 · 0 评论