https://atcoder.jp/contests/abc148 这场比较简单D - Brick Break二分or LIS#include <bits/stdc++.h> #define ll long long using namespace std; const int N = 200005; int a[N], n, ans = 1, f[N]; //f[i]:以i结尾 map<int, int> mp; bool suc; set<int> s[N]; int main (...
Easy ABC! I can get higher rating. Thx problem provider. → Reply Jerrlee 3 years ago, # | +14 In fact,I think B is easier than A... (Maybe I'm strange. → Reply llc5pg 3 years ago, # ^ | 0 I solved B, but not able to solve A. → Reply __hermit__ 3 ...
ABC 148 第一次打abc,记录一下 Task NameTime LimitMemory Limit ARound One2 sec1024 MB BStrings with the Same Length2 sec1024 MB CSnack2 sec1024 MB DBrick Break2 sec1024 MB EDouble Factorial2 sec1024 MB FPlaying Tag on Tree2 sec1024 MB ...
abc107 B - Grid Compression 座標圧縮 abc213 C - Reorder Cards 座標圧縮 abc231 F - Jealous Two 座標圧縮, Binary Indexed Tree abc234 D - Prefix K-th Max Heap, Binary Indexed Tree chokudai_S001 J - 転倒数 Binary Indexed Tree abc185 F - Range Xor Query Binary Indexed Tree arc033 C...
2019-12-22 22:31 −[TOC] # AtCoder Beginner Contest 148 题解 ## 前言 **包含题目:** [ABC148 A](https://atcoder.jp/contests/abc148/tasks/abc148_a) [ABC148 B](https://atcoder.jp/co... BurnoutAg7 0 555 AtCoder Beginner Contest 143 F - Distinct Numbers ...
2019-12-22 22:31 − [TOC] # AtCoder Beginner Contest 148 题解 ## 前言 **包含题目:** [ABC148 A](https://atcoder.jp/contests/abc148/tasks/abc148_a) [ABC148 B](https://atcoder.jp/co... BurnoutAg7 0 555 AtCoder Beginner Contest 143 F - Distinct Numbers 2019-12-14 14:...
ABC269 F - Numbered Checker Tip:Math题意:给定一个 行 列的矩阵, 。矩阵内每个小方块都有一个值,例如方块 的值为 。其中如果 为奇数那么方块值为 。有 个查询,问每个子矩阵内所有数值和为多少?思路:每次… 阅读全文 AtCoder Beginner Contest 267 F - Exactly K Steps ...
Search or jump to... Search code, repositories, users, issues, pull requests... Provide feedback We read every piece of feedback, and take your input very seriously. Include my email address so I can be contacted Cancel Submit feedback Saved searches Use saved searches to filter your...
//https://atcoder.jp/contests/abc345/submissions/51423091 #pragma GCC optimize(3) #include<bits/stdc++.h> using namespace std; using LL = long long; #define endl '\n' using db = double; template <class T> using max_heap = priority_queue<T>; template <class T> using min_heap =...
abc出现次数的最大值和最小值相差不超过1 代码 #include <bits/stdc++.h> #define fi first #define se second #define pii pair<int,int> #define pdi pair<db,int> #define mp make_pair #define pb push_back #define enter putchar('\n') #define space putchar(' ') #define eps 1e-8 #...