Atcoder
successzjl23
因为热爱,所以坚持;不给自己留退路才能大步向前,不要摸鱼了,请不要假装学习,结果不会陪我们演戏!
展开
-
Panasonic Programming Contest 2021(AtCoder Beginner Contest 231)
D#include <bits/stdc++.h>using namespace std ;const int N = 1e6 + 10 ;int st[N], f[N] ;int father(int x) { if (f[x] != x) f[x] = father(f[x]) ; return f[x] ;}int main(){ int n ,m ; cin >> n >> m ; for (int i = 1; i <= n; i原创 2022-01-03 09:07:31 · 484 阅读 · 0 评论 -
AtCoder Beginner Contest 230
Ehttps://atcoder.jp/contests/abc230/tasks/abc230_e先找出来k0=floor(sqrt(n))k0 = floor(sqrt(n))k0=floor(sqrt(n))可以发现floor(n/i)=kfloor(n / i) = kfloor(n/i)=kk<=n/i<=k+1k <= n / i <= k + 1k<=n/i<=k+1n/(k+1)<=i<=n/kn / (k + 1) <= i原创 2021-12-31 16:23:04 · 367 阅读 · 0 评论 -
Daiwa Securities Co. Ltd. Programming Contest 2021(AtCoder Regular Contest 128)A-B题解
A思路:贪心 看数列可以分成几部分上升子序列 子序列最小的数和最大的数(最大数的时候转换成银,最小数的时候转换金)代码:#include <bits/stdc++.h>using namespace std;const int N = 200010;int n, a[N], b[N];int main(){ cin >> n ; for (int i = 1; i <= n; i ++ ) cin >> a[i]; for (int i原创 2021-10-22 07:58:29 · 211 阅读 · 0 评论 -
ABC208a~d
A#include <algorithm>#include <iostream> using namespace std; long long n, m; int main(){ cin >> n >> m; if (m >= n && m <= n * 6) cout << "Yes" << endl; else cout << "No" <<原创 2021-07-14 21:45:48 · 152 阅读 · 0 评论 -
ABC209a~d题解
最近两场发现ABC前三道是签到题 第四道是图论题是简单图论第五道第六道会加大难度还有我发现一个问题abc的英语太难读了~唔A在b大于a是打印ab的差值#include <algorithm>#include <iostream>#include <cstring> #define xx first#define yy second#define ll long long#define L(i, j, k) for (int i = j; i <原创 2021-07-14 10:59:07 · 258 阅读 · 0 评论