随笔分类 -  模拟

树状数组
摘要：const ll N = 1333; int n; struct BIT { int tag[MAXN], t[MAXN], Tag; void reset() { ++Tag; } void add(int k, int v) { while (k <= n) { if (tag[k] != Ta 阅读全文
posted @ 2021-04-23 13:38 u_yan 阅读(33) 评论(0) 推荐(0)
口罩发放
摘要：#include <iostream> #include <vector> #include <map> #include <algorithm> using namespace std; const int N = 2800; map<string, int>GotTime; map<string 阅读全文
posted @ 2021-04-09 21:19 u_yan 阅读(76) 评论(0) 推荐(0)