![](https://img-blog.csdnimg.cn/20201014180756926.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
cf
itsmoumou
蒟蒻一枚
展开
-
拓扑排序--Kitchen Plates
J. Kitchen Plates找入度为0的点,使与其连接的点都入度-1。#include<iostream>#include<cstdio>#include<string>#include<cmath>#include<cstring>#include<algorithm>#include<map>#include<queue>#include<vector>using na原创 2021-09-17 00:07:43 · 96 阅读 · 0 评论 -
单调栈--Jumping Buildings
参考:序列 3,4,2,6,4,5,2,3:找出左边第一个比他大的值的下标如果当前值比栈顶元素要大:弹栈如果当前值比栈顶元素要小:压栈综合来说:就是先把不合法的弹栈,然后必然要压栈。 //sta[]记录下标 for(int i=n;i>=1;i--) { while(tp&&a[sta[tp]]<=a[i]) tp--; if(tp==0) ans[i]=0; else ans[i]=sta[tp]; sta[++tp]=i; }...原创 2021-09-15 21:48:52 · 73 阅读 · 0 评论 -
分块,单调栈--Water Balance
E. Water Balance类似于单调栈的思想,分块巧妙sum数组记录每一段的平均值,l数组记录每一段的长度p每次加着走。因为后面的sum[]还会更新,所以每次合并区间是更改的p-1#include<iostream>#include<cstdio>#include<string>#include<cmath>#include<cstring>#include<algorithm>#include<map原创 2021-09-15 11:23:07 · 48 阅读 · 0 评论 -
【排列】 Jury Meeting
C. Jury Meeting容易搞错数字含义。1.最大的个数大于1:全部排列就是答案2.(1不成立,即只有一个最大的)不存在比最大的小1的:03.(1,2不成立):排列组合,其实正面做也不难。#include<iostream>#include<cstdio>#include<string>#include<cmath>#include<cstring>#include<algorithm>#include<原创 2021-09-10 21:52:46 · 60 阅读 · 0 评论 -
string,STL
C. Obtain The String字符串太长,考虑′a′'a'′a′~′z′'z'′z′肯定要保存下每个字符在sss里的所有位置一对多:vectorvectorvector#include<iostream>#include<cstdio>#include<string>#include<cmath>#include<cstring>#include<algorithm>#include<map>原创 2021-09-06 17:50:39 · 48 阅读 · 0 评论 -
cf-string,math
C. Carrying Conundrum分奇偶看#include<iostream>#include<cstdio>#include<string>#include<cmath>#include<cstring>#include<algorithm>#include<map>#include<vector>using namespace std;#define ll long long#原创 2021-09-06 16:27:18 · 60 阅读 · 0 评论 -
01字符串
B题意:给出一个01字符串s,将它无限重复,求有几个前缀和为x的前缀(0则+1,1则-1)进行+1,-1的操作,最后的值肯定是从最小的值一个个过渡到最大的值1.题中给出:无限个则为-1,前提肯定是能满足x的,那么即整个串为0,串的前缀又符合为x。2.满足x的:即x=num*()+Min~Max。3.否则不满足x,即为0。注意:空前缀只有在x=0时才有贡献#include<iostream>#include<cstdio>#include<string>原创 2021-09-05 00:16:15 · 227 阅读 · 0 评论 -
Codeforces Round #738 (Div. 2)
C. Mocha and Hiking别忽略了n+1这个点#include<iostream>#include<cstdio>#include<string>#include<cmath>#include<cstring>#include<algorithm>#include<map>#include<vector>using namespace std;#define ll long lo原创 2021-08-17 20:24:15 · 38 阅读 · 0 评论 -
~~~合集
Polycarp and Coins尽量相等,就先两张一起减,差了就补。原创 2021-08-04 17:19:30 · 78 阅读 · 2 评论