typedeflonglongLL; typedef pair<int,int>PII;#definePI acos((double)-1)#defineE exp(double(1))#defineK 100000+9inta[K],vis[K],pos[K*10];intsz,n,m;doubleans[K*10],sum,num; map<int,int>p;structnode {intl,r,id; }q[K*10];intcmp(node ta,node tb) {if(pos[ta.l]==pos[tb...
typedef pair<int,int>pii; priority_queue<pii,vector<pii>,greater<pii> >q;structedge{intx,z,next; }e[300005];intn,m,f[30005],vis[30005],tot=1,head[30005];voidadde(intu,intx,intz)//建树{ e[tot].x=x; e[tot].z=z; e[tot].next=head[u]; head[u]=tot++; }intmain() {i...
程序执行将在此处开始并结束。//#include"pch.h"#include<iostream>#include<vector>#include<algorithm>#include<set>using namespace std;typedefpair<int,int>pii;constintN=110,INF=1e9;intr,c;intsr,sc;set<pii>row[N],col[N];intmove(set<pii>&segs,intx,intdir){autoi=segs.lower_bound({x,x}...
代码: #include <iostream>#include <cstring>#include <algorithm>#define x first#define y secondusing namespace std;typedef pair<int, int> PII;const int N = 100010;int n, m;PII stk[N];int ans[N];int main(){scanf("%d%d", &n, &m);int top = 0;while (m -- ){int p, q;scan...
#define pm make_pair usingnamespacestd; typedefpair<int,int>PII; constintMAX=2e5+5; map<ll,ll>mp; intn; llx,ans,sum; intmain() { cin>>n; for(inti=1;i<=n;i++) { cin>>x; sum+=x; mp[sum]++; ans=max(ans,mp[sum]); ...
#include<cstdio> #include<iostream> #include<algorithm> #include<cstring> #include<queue> using namespace std; typedef pair<int, int> PII; const int N = 1e6 + 10; const int INF = 0x3f3f3f3f; // 返回最大值 inline int MAX(int a, int b) { return (a > b) ? a : b; } /...
typedef pair<int, int> PII; typedef long long ll; typedef unsigned long long ull; typedef long double ld; const int MOD = 1e9 + 7; const double eps = 1e-9; const ll INF = 0x3f3f3f3f3f3f3f3fll; const int inf = 0x3f3f3f3f; ...
typedef long long ll; typedef pair<int,int> pii; typedef pair<ll,ll> pll; ll read(ll x=0) { ll c, f(1); for(c=getchar();!isdigit(c);c=getchar())if(c=='-')f=-f; for(;isdigit(c);c=getchar())x=x*10+c-0x30; return f*x; } struct Graph { int etot, head[max...
#include<bits/stdc++.h>#define x first#define y secondusingnamespacestd;typedeflonglongll;typedef__int128i128;typedefpair<int,int>pii;constintN=2e5+10,mod=998244353;intb[N],a[N];constintB=31;structlinear_basis{intnum[B];intrank;voidclear(){rank=0;for(inti=0;i<B;i++)num[i]=0...
PII;typedef pair<long,long>PLL;typedef pair<char,char>PCC;typedef long long ll;constintN=1e5+10;constintM=150;constintINF=0x3f3f3f3f;constintMOD=998244353;ll a[N],b[N],ans[N],w[N];bool used[N];structDSU{vector<int>data;voidinit(int n){data.assign(n,-1);}boolunionSet(int ...