whosemario的专栏

<br />#include<stdio.h>int main(){ unsigned int n; while(scanf("%d",&n)!=EOF){ printf("%d/n",n*(n+1)/2); printf("/n"); }} 

一开始已离散的方式求解，第三个样例过不了，代码如下：#includeusing namespace std;double delta(double a,double b){ double tmp; if(a180.0) a=360.0-a; return a;}int main(){ double D; while(scanf("%lf",&D)){ if(D==-1) break;

#includeusing namespace std;#define MAXN 103int room[MAXN][2];struct Edge{      int to,next;}edge[MAXN*2];int list[MAXN];int ind;int col[MAXN];int dp[MAXN][MAXN];void init(){memset(list,-1,sizeof(list));ind=0;}void insert(int a,int b){     edge[ind].to=b; 

小HH推荐的题目，说是用Splay-Tree可以过，没想到方法，就先用了线段树，WA了一天啊，没有找出错误，贴代码如下：#includeusing namespace std;#define MAXN 50002struct node{ int l,r; int mb,mc; /* 最大空闲区间起始地址和长度 */ int nl,nr; /* 左右起始空闲区间长度 */ char sta; /

<br />Splay Tree,重点在子树的旋转，线段树很难实现：<br />#include<iostream>#define DEBUG_ENABLE 1using namespace std;#define MAXN 100005#define KeyNode (ch[ch[root][1]][0])int num[MAXN][2];struct Pair{int v,i;};struct SplayTree{ int sz[MAXN];

<br />#include<iostream>#include<algorithm>#define DEBUG_ENABLE 1using namespace std;#define MAXN 100005#define KeyNode (ch[ch[root][1]][0])struct operate{ char c; int x;}op[MAXN];int seg[MAXN*2][2];int f[MAXN];struct SplayTre

#include#define DEBUG_ENABLE 1using namespace std;#define MAXN 100005#define KeyNode (ch[ch[root][1]][0])struct SplayTree{ int sz[MAXN*3]; //sz[x]-x为根结点的结点数量 int ch[MAXN*3][2]; //ch[x][0]-x的左子节点;ch[x][1]-x的右