coder_coder_coder的专栏

#include #include using namespace std; const int N=100010; long long a[N],b[N],query[N],sumq[N]; int n,m,k,x,y; struct state{     int l,r,d; }op[N]; int main() {     cin>>n>>m>>k;  

// #include #include #include using namespace std; const int N=10005; int a[N],b[N],n,m,x,y; int main(){ while(scanf("%d%d",&n,&m)==2){ memset(a,0,sizeof(a)); memset(b,0,sizeof

//代码#include #include #include using namespace std; const int N=10005; int a[N],b[N],n,m,x,y; int main(){ while(scanf("%d%d",&n,&m)==2){ memset(a,0,sizeof(a)); memset(b,0,sizeo