![](https://img-blog.csdnimg.cn/20201014180756918.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
GYM
穷源溯流
路很长,尽管走便是。
展开
-
Gym The 13th Chinese Northeast Collegiate Programming Contest B. Balanced Diet(思维)
const int N=1e5+5; int n,m,_; int i,j,k; vector<ll> v[N],pre[N]; int a[N]; int len[N];int main(){ rush(){ sdd(n,m); for(int i=1;i<=m;i++) sd(a[i]); for(int i=1;i<=n;i++){ in...原创 2021-05-07 16:12:53 · 231 阅读 · 0 评论 -
Gym The 15th Heilongjiang Provincial Collegiate Programming Contest B. Bills of Paradise(权值线段树+区间操作)
const int N=1e6+5; int n,m,_; int i,j,k; //int a[N];unsigned long long k1, k2;unsigned long long xorShift128Plus() { unsigned long long k3 = k1, k4 = k2; k1 = k4; k3 ^= k3 << 23; k2 = k3 ^ k4 ^ (k3 >> ...原创 2021-05-06 13:43:34 · 326 阅读 · 0 评论 -
Gym The 17th Zhejiang Provincial Collegiate Programming Contest E.Easy DP Problem(主席树)
const int N=1e5+5; int n,m,_; int i,j,k; int a[N]; struct Node { int l,r; int sz; ll sum; }t[N<<5]; int root[N],tot=0; vector<int> v;void update(int &x,int y,int l,int r,int pos){.原创 2021-05-05 10:30:54 · 248 阅读 · 0 评论 -
Gym The 17th Zhejiang Provincial Collegiate Programming Contest B. Bin Packing Problem(线段树+map)
const int N=1e6+5; int n,m,_; int i,j,k; int a[N]; struct Node { int l,r; int maxx; #define lson id<<1 #define rson id<<1|1 }t[N<<2]; multimap<int,int> mp;void push_up(.原创 2021-05-05 10:16:46 · 314 阅读 · 0 评论 -
Gym The 13th Chinese Northeast Collegiate Programming Contest H. Skyscraper(线段树+差分)
前置题目:BLOGconst int N=1e5+5; int n,m,_; int i,j,k; ll a[N]; ll d[N]; struct Node { int l,r; ll sum,plu; #define lson id<<1 #define rson id<<1|1 }t[N<<2];void push_up(...原创 2021-05-04 09:37:38 · 171 阅读 · 0 评论 -
Gym 2019 Sichuan Province Programming Contest A. Autochess(线段树+STL瞎搞)
const int N=1e5+5; int n,m,_; int i,j,k; //int a[N]; map<string,vector<int>> mp; vector<string> ans; int len; struct Node { int l,r; int sum; #define lson id<<1 ...原创 2021-05-03 09:50:28 · 665 阅读 · 3 评论 -
The 18th Zhejiang Provincial Collegiate Programming Contest L.String Freshman(KMP)
const int N=2e5+5; int n,m,_; int i,j,k; char a[N]; int f[N];void getfail(char *s){ f[0]=f[1]=0; int len=strlen(s); for(int i=1;i<len;i++){ int j=f[i]; while(j && s[i]!=s[j]) j=f[j]; ...原创 2021-05-01 18:00:43 · 1004 阅读 · 1 评论 -
GYM 101147 E. Jumping(最短路径转化+spfa)
有 n 个点,每个点 i 都可以传送到 i+x,或 i-x 的位置(每个点必须满足在区间 [1,n] 上),求每个点 i 到达 n 的最小传送次数将 i -> i-x 转化为 起点为 i ,终点为 i-x,边权为 1 的路径,借助最短路径算法求解const int N=2e5+5; int n,m,t; int i,j,k; int head[N],all=0; int d[N]; //点 i 到起点的距离 bool vis[N]...原创 2020-08-07 16:06:14 · 207 阅读 · 0 评论 -
H. The Longest Good Substring(尺取的另一种姿势)
给出一个字符串,求字符串所有子串中(出现的不同字母数不超过k)的最长的一个子串的起始位置和终止位置 map<int,int> mp;int main(){ IOS; freopen("input.txt","r",stdin); freopen("output.txt","w",stdout); while(cin>>k){ string s; cin>>s; int ...原创 2020-06-28 22:23:30 · 1971 阅读 · 0 评论