摘要:
#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; typedef long long ll; const int N=500005; const ll INF=(1LL<<60)-1; int a[N]; ll sum[N]; int main() { int 阅读全文
摘要:
#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 <bits/stdc++.h> using namespace std; typedef long long ll; const int maxn=1e6+7; #define int long long int a[107]; int n,m; int check(int x) 阅读全文
摘要:
#include <bits/stdc++.h> using namespace std; #define ll long long #define P pair<int,int> #define mk make_pair const int N = 2e3 + 10; void solve() { 阅读全文
摘要:
#include<iostream> #include<algorithm> #include<cstdio> #include<cstring> using namespace std; const int maxn=15,maxx=100005; int tmp[maxn],vis[10]; l 阅读全文