![](https://img-blog.csdnimg.cn/20201014180756922.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
2021暑假集训
文章平均质量分 92
Yanzu_Wu.
这个作者很懒,什么都没留下…
展开
-
codeforces暑假集训第二周总结
Moamen and k-subarrays#include<bits/stdc++.h>using namespace std;const int maxn = 1e5 + 10;int t,k,n,x,cnt;int main(){ cin >> t; while(t--){ cnt = 1; cin >> n >> k; vector < pai.原创 2021-08-10 17:19:53 · 94 阅读 · 0 评论 -
codeforces2021暑假第一周总结
C - Reorder the Array Codeforces Round #497 (Div. 2)#include<iostream>#include<map>using namespace std;map <int,int> m;int n,maxn,a;void solve(){ for(int i = 0;i < n;i++){ cin >> a; m[a]++; } maxn = -1;.原创 2021-07-24 18:30:14 · 113 阅读 · 0 评论