摘要:
水题#include#include#include#includeusing namespace std;const int MAXN = 10010;int pos[MAXN],a[MAXN];int main(){ int n,x,Q,cnt(0); while(~scanf("%... 阅读全文
摘要:
STL的应用#include#include#include#include#include#include#includeusing namespace std;string str, s;mapmp;vectorV, ans;void recordStr(string s){ //cout... 阅读全文
摘要:
思路:使用优先队列,按队伍出现的时刻和自身出现的时刻定义优先级,同时记录此时刻队列里是否有自己队伍的人,一开始没注意,wa了两发。#include#include#include#include#include#include#includeusing namespace std;const int... 阅读全文