随笔分类 - dp
摘要:https://blog.csdn.net/a_forever_dream/article/details/105581221 https://blog.csdn.net/a_forever_dream/article/details/105587292 #include <cstdio> #inc
阅读全文
摘要:#include<map> #include<queue> #include<time.h> #include<limits.h> #include<cmath> #include<ostream> #include<iterator> #include<set> #include<stack> #
阅读全文
摘要:参考:https://www.luogu.com.cn/blog/RPdreamer/p2051 #include<map> #include<queue> #include<time.h> #include<limits.h> #include<cmath> #include<ostream> #
阅读全文
摘要:#include<cstdio> #include<cstring> #include<iostream> #include<algorithm> using namespace std; const int N=6e6+10; #define int long long int e[N],h[N]
阅读全文
摘要:#include<map> #include<queue> #include<time.h> #include<limits.h> #include<cmath> #include<ostream> #include<iterator> #include<set> #include<stack> #
阅读全文
摘要:#include<map> #include<queue> #include<time.h> #include<limits.h> #include<cmath> #include<ostream> #include<iterator> #include<set> #include<stack> #
阅读全文
摘要:#include<map> #include<queue> #include<time.h> #include<limits.h> #include<cmath> #include<ostream> #include<iterator> #include<set> #include<stack> #
阅读全文
摘要:#include<map> #include<queue> #include<time.h> #include<limits.h> #include<cmath> #include<ostream> #include<iterator> #include<set> #include<stack> #
阅读全文
摘要:#include<map> #include<queue> #include<time.h> #include<limits.h> #include<cmath> #include<ostream> #include<iterator> #include<set> #include<stack> #
阅读全文
摘要:#include<cstdio> #include<iostream> using namespace std; typedef long long ll; const int N=2e6+5; ll q[N]; ll sum[N],a[N],n,p,d; ll l,r;//维护区间 ll hh,t
阅读全文
摘要:#include<map> #include<queue> #include<time.h> #include<limits.h> #include<cmath> #include<ostream> #include<iterator> #include<set> #include<stack> #
阅读全文
摘要:#include<map> #include<queue> #include<time.h> #include<limits.h> #include<cmath> #include<ostream> #include<iterator> #include<set> #include<stack> #
阅读全文
摘要:#include <cstdio> #include <iostream> using namespace std; int n,m,x; int hh,tt,a[1000001],q[1000001],f[1000001]; int read() { char ch=getchar(); int
阅读全文
摘要:#include<bits/stdc++.h> const int N=100+10; const int T=5000; using namespace std; int n,t,k,ans; int v[N],h[N],f[T]; int now; //如果不考虑大的,x=t-h[i] //考虑
阅读全文
摘要:#pragma GCC optimize(2) #include<bits/stdc++.h> #define ll long long const int maxn=1000005; const int inf=0x3f3f3f3f; using namespace std; ll dp[maxn
阅读全文
摘要:#include<bits/stdc++.h> using namespace std; const int N=1e6+10; int a[N]; int n; int tr[N]; int f[N]; int ans; int lowbit(int x) { return x&-x; } voi
阅读全文
摘要:#include<map> #include<queue> #include<time.h> #include<limits.h> #include<cmath> #include<ostream> #include<iterator> #include<set> #include<stack> #
阅读全文
摘要:#include<iostream> #include<algorithm> #include<cstdio> #include<cstring> using namespace std; const int maxn=15,maxx=100005; int tmp[maxn],vis[10]; l
阅读全文
摘要:#pragma GCC optimize(2) #include<cstdio> #include<cstring> #include<iostream> #include<algorithm> using namespace std; const int N=39,M=150; int n,m,t
阅读全文
摘要:#include <bits/stdc++.h> using namespace std; const int N=2020; int f[N][N][2],a[N]; int main() { int n; cin>>n; for(int i=1; i<=n; i++) cin>>a[i]; fo
阅读全文