宏亮的专栏

RMQ:http://blog.csdn.net/liang5630/article/details/7917702 #include #include #include using namespace std;const int N=100005;int minsum[N][21],maxsum[N][21];// f(i,j)表示i~i+(2^j)-1中最大或者最小值；

#includeusing namespace std;typedef struct node{ int data; struct node *next;} *stack;void init(stack &s){ s=NULL;}int pop(stack &s){ int x; x=s->data; s=s->next; return x;}void push(

旋转对中序遍历没有影响，直接中序输出即可。#include #include using namespace std;int n;struct Shu{ int left,rigth;}shu[1000005];int zhong(int id){ if(id>=0) { zhong(shu[id].left); cout<<id<<endl; zhong(s

测试地址：http://acm.nyist.net/JudgeOnline/problem.php?pid=35package calc;import java.util.HashMap;import java.util.LinkedList;import java.util.List;import java.util.Map;import java.util.Scanner;