程序人生

利用两个数组，一个记录当前队列情况，另一个记录id对应的同学所在的位置#include<iostream>#include<sstream>#include<cstdio>#include<string>#include<cstring>#include<vector>#include<queue...

思路：排序，然后判断中位数是否符合条件，用双指针定位#include<iostream>#include<sstream>#include<cstdio>#include<string>#include<cstring>#include<vector>#include<queue>#i

题目中后面这个条件容易忽略造成错误 购票时，一个人可能购一张或多张票，最多不超过5张。如果这几张票可以安排在同一排编号相邻的座位，则应该安排在编号最小的相邻座位。否则应该安排在编号最小的几个空座位中（不考虑是否相邻）。#include<iostream>#include<sstream>#include<cstdio>#include...

思路：记录好各个关键节点即可#include<iostream>#include<sstream>#include<cstdio>#include<string>#include<cstring>#include<vector>#include<queue>#include<

思路：遍历所有的行和列，如果相同，则标记，最后根据标记输出即可 #include<iostream>#include<sstream>#include<cstdio>#include<string>#include<cstring>#include<vector>#include<queue&gt

模拟进制运算，累计进位即可#include<iostream>#include<sstream>#include<cstdio>#include<string>#include<cstring>#include<vector>#include<queue>#include&lt

记录出现次数，然后自定义排序即 不知道为什么，DEV下编译不通过，但是提交还是对的#include<iostream>#include<sstream>#include<cstdio>#include<string>#include<cstring>#include<vector>#inclu...

搞清楚Z字形的坐标变换，不要犯迷糊就好#include<iostream>#include<sstream>#include<cstdio>#include<string>#include<cstring>#include<vector>#include<queue>#include&

考点：树状数组的应用，如果懂树状数组，那么这个题很轻松拿下#include<iostream>#include<sstream>#include<cstdio>#include<string>#include<cstring>#include<vector>#include<queue>#

思路：首先是处理订单，将有效的购物订单存储到vector中，方便后面排序。（这里有个大坑，cancel i指的是第i行的数据，而不是第i个订单，起初把这个搞混了，只有30分，改了后就满分了）。然后对订单按照价格排列，之后采用了两个订单累积和的数据dp_buy[i]表示售价为buy[i]时愿意买的人的总数；dp_sell[i]表示售价为sell[i]时愿意卖的人的总数。 题目整体...

思路：CSP出日期增加判断的题目，都是用一天一天加，然后判断条件，这类题目简单，但是也不能掉以轻心。#include<iostream>#include<sstream>#include<cstdio>#include<string>#include<cstring>#include<vector>...

CCF第二题基本都是模拟，但是近年来判断的条件越来越繁琐，不留神判断条件粗心的童靴很容易做错了，所以，如何自定义测试例子是CCF前四题保分的基础啊！#include<iostream>#include<sstream>#include<cstdio>#include<string>#include<cstring>#...

水题#include<iostream>#include<sstream>#include<cstdio>#include<string>#include<cstring>#include<vector>#include<map>#include<set>#i

此题目直接用map标记次数即可，水题#include<iostream>#include<cstdio>#include<map>using namespace std;int main() { //freopen("d:\\input.txt","r",stdin); map<int,int> m; ...

直接模拟，水题#include<iostream>#include<cstdio>#include<vector>#include<string>#include<map>using namespace std;int main() { //freopen("d:\\input.txt","r",

考察最大的矩形，其特点是至少有一根柱子达到了顶点然后双指针法即可#include<iostream>#include<cstdio>#include<vector>using namespace std;int main() { //freopen("d:\\input.txt","r",stdin); int n,vec[...

题目出的很好，值得学习#include<iostream>#include<cstdio>#include<vector>#include<string>#include<map>using namespace std;/* 当然还是dp了，不过，此前做过的题目当中，没有按照类似的根据设定状态转移的dp ...

这个很一般的DFS告诉我们，如果两个遍历的规则差太多的话，还是别想着和到一起写，就可以省去很多麻烦#include<iostream>#include<cstdio>#include<cstring>using namespace std;/* 出现编译错误的原因肯定是缺少了头文件，这里没有加csting，memset是其中函数 ...

水题#include<iostream>#include<cstdio>#include<set>using namespace std;int main() { //freopen("d:\\input.txt","r",stdin); int n,t,cnt=0; set<int> m; ...

根据题目描述模拟即可#include<iostream>#include<cstdio>#include<vector>#include<set>using namespace std;struct wdo{ int id; int x1,y1,x2,y2; wdo operator=(const w...

感觉自己写的哪里都对，但就是过不了，看了别人的答案也感觉思路很一致，最后还是折腾了重新写才过了#include<iostream>#include<sstream>#include<cstdio>#include<string>#include<cstring>#include<vector>#incl...

#include<iostream>#include<sstream>#include<cstdio>#include<string>#include<cstring>#include<vector>#include<map>#include<set>#include&a

好好读题，专心做题#include<iostream>#include<sstream>#include<cstdio>#include<string>#include<cstring>#include<vector>#include<map>#include<set&a

请问我写的这个最大最小搜索是哪里不对呢？样例都能过，时间空间都不超，为什么提交是0分呢？#include<cstdio>#include<iostream>#include<set>#include<vector>#include<queue>#include&am