摘要：
/*hdu1754满二叉树递推式处理线段树,输入输出优化外挂*/#include<cstdio>const int M=262144;int max(int a,int b){return a>b?a:b;}int tr[16],n,m,i,a,b,c,N;inline bool scan_ud(int &num) //输入函数,以字符的形式输入{ char in; in = getchar(); if(in == EOF) return false; while(in < '0' || in > '9') in = get 阅读全文
摘要：
#include "iostream"#include <cstdio>#define MAX 200005#define lc(x) ((x)<<1)#define rc(x) (((x)<<1)+1)using namespace std;struct node {int l,r,m;};int score[MAX];node tree[MAX*3];int N,M,p,q;char cmd[2];int mmax(int x,int y){return x>y? x:y;}int build(int l,int r,int i 阅读全文