摘要：
题目链接：http://codeforces.com/problemset/problem/655/E After getting kicked out of her reporting job for not knowing the alphabet, Bessie has decided to 阅读全文
posted @ 2019-12-08 22:12
执||念
阅读(177)
评论(0)
推荐(0)
摘要：
题目链接：http://codeforces.com/problemset/problem/602/E E. Kleofáš and the n-thlon time limit per test 1 second memory limit per test 256 megabytes input 阅读全文
posted @ 2019-12-08 16:22
执||念
阅读(292)
评论(0)
推荐(0)
摘要：
stack<int> st; //此处一般需要给数组最后添加结束标志符，具体下面例题会有详细讲解 for (遍历这个数组) { if (栈空 || 栈顶元素大于等于当前比较元素) { 入栈; } else { while (栈不为空 && 栈顶元素小于当前元素) { 栈顶元素出栈; 更新结果; } 阅读全文
posted @ 2019-12-08 12:22
执||念
阅读(114)
评论(0)
推荐(0)
摘要：
题目链接http://codeforces.com/problemset/problem/602/D A function is called Lipschitz continuous if there is a real constant K such that the inequality |f 阅读全文
posted @ 2019-12-08 12:20
执||念
阅读(222)
评论(0)
推荐(0)
浙公网安备 33010602011771号