Starry

回头膜一下jls的 #include <bits/stdc++.h> /* #include<ext/pb_ds/assoc_container.hpp> #include<ext/pb_ds/hash_policy.hpp> */ using namespace std; const double eps = 1e-10; const double pi = 3.1415926535897932384626433832795; const double eln &#

抄题解好手？mark一下 #include<bits/stdc++.h> #define int long long using namespace std; int d[4000009]; int n,M,T,mod,p; signed main(){ for(scanf("%lld",&T);T;--T){ scanf("%lld%lld",&n,&mod); for(M=1;M<=n;M<<=1)

老是写挂:) #include<bits/stdc++.h> using namespace std; using ll=long long ; const int maxn=2e5+9; struct Node{ ll l,r,v,tag; }tr[maxn<<2]; ll n,f,a[maxn]; void build(int l,int r,int tot){ if(l==r){ tr[tot].v=a[l];

最长公共子序列考虑到元素各异，变成最上不降子序列 #include <bits/stdc++.h> /* #include<ext/pb_ds/assoc_container.hpp> #include<ext/pb_ds/hash_policy.hpp> */ using namespace std; const double eps = 1e-10; const double pi = 3.1415926535897932384626433832795; cons

有点吉司机线段树的味 #include<bits/stdc++.h> using namespace std; using ll=long long; const int maxn=1e5+9; struct Node{ ll l,r,v,ma; }tr[maxn<<2]; ll n,m,a[maxn]; void build (int l,int r,int tot){ if(l==r){ tr[tot].v=tr[tot].