STL
SSimpLe_Y
人一我百,人十我万,然而我做不到。
展开
-
map 的用法(待补充)
1. map最基本的构造函数;(前面是下标,后面是对应的值)map<string ,int>mapstring; map<int,string >mapint;map<sring,char>mapstring; map< char ,string>mapchar;map<char,int>mapchar; map<int ,ch...原创 2016-05-23 20:43:08 · 347 阅读 · 0 评论 -
表达式求值
河南省第九届大学生程序设计竞赛 A题Description假设表达式定义为:1. 一个十进制的正整数 X 是一个表达式。2. 如果 X 和 Y 是 表达式,则 X+Y, X*Y 也是表达式; *优先级高于+.3. 如果 X 和 Y 是 表达式,则 函数 Smax(X,Y)也是表达式,其值为:先分别求出 X ,Y值的各位数字之和,再从中选最大数。4.如果 X 是 表达原创 2016-10-02 10:18:06 · 864 阅读 · 0 评论 -
lightoj 1113 - Discover the Web(STL栈)
Standard web browsers contain features to move backward and forward among the pages recently visited. One way to implement these features is to use two stacks to keep track of the pages that can be re原创 2016-11-09 15:30:31 · 871 阅读 · 0 评论 -
lightoj 1424 - New Land(单调栈)
Once upon a time there lived an old wise king. He had only one son. The prince had the idea that he (the prince) was about to be the future king; that's why he became too lazy day by day. This made th原创 2017-04-07 17:06:57 · 1183 阅读 · 0 评论 -
长度不超过m的最大连续子序列(dp + 单调队列)
给你n个数,然后让你求最大连续子序列的和,限制条件是连续子序列的长度不超过m。n,m 就是让你找到一个长度不超过m的区间,区间和最大。普通的dp转移方程就是 dp[i] = sum[i] - min(sum[j] | i- m 但是这样的复杂度最坏会达到n^2,所以得优化,就用到了单调队列。针对这题来说一下什么是单调队列,这题我们需要存下距离不超过m,且最小的前缀和的下标。原创 2017-05-13 12:11:51 · 7295 阅读 · 0 评论 -
Codeforces Round #433 C. Planning(贪心)
Helen works in Metropolis airport. She is responsible for creating a departure schedule. There are n flights that must depart today, the i-th of them is planned to depart at the i-th minute of the原创 2017-09-07 08:01:11 · 1721 阅读 · 0 评论