hdu4699 Editor 2013 多校训练第十场 D题 数列维护 splay | 线段树 | 栈！！！！！

题意：维护一个文本编辑，并且查询最大前缀和。

写了splay，wa了13次

过了之后觉着特傻逼。发现题解两个栈就可以了，光标前后维护两个栈，维护前面的栈的前缀和 和 最大前缀和。

哎，傻逼，太弱了，还是没仔细分析题目的特殊性质。

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <cassert>
#include <iostream>
#include <sstream>
#include <fstream>
#include <map>
#include <set>
#include <vector>
#include <queue>
#include <algorithm>
#include <iomanip>
using namespace std;

#define abs(x) ((x)>=0?(x):-(x))
#define i64 long long
#define u32 unsigned int
#define u64 unsigned long long
#define clr(x,y) memset(x,y,sizeof(x))
#define PI acos(-1.0)
#define sqr(x) ((x)*(x))

#define inf 0x3f3f3f3f
#define keyTree (ch[ ch[root][1] ][0])

const int maxn = ;

struct SplayTree {
  int sz[maxn];
  int ch[maxn][];
  int pre[maxn];
  int root , top1 , top2;
  //int ss[maxn] , que[maxn];

  void Rotate(int x,int f) {
    int y = pre[x];
    ch[y][!f] = ch[x][f];
    pre[ ch[x][f] ] = y;
    pre[x] = pre[y];
    if(pre[x]) ch[ pre[y] ][ ch[pre[y]][] == y ] = x;
    ch[x][f] = y;
    pre[y] = x;
    push_up(y);
  }
  void Splay(int x,int goal) {
    while(pre[x] != goal) {
      if(pre[pre[x]] == goal) {
        Rotate(x , ch[pre[x]][] == x);
      } else {
        int y = pre[x] , z = pre[y];
        int f = (ch[z][] == y);
        if(ch[y][f] == x) {
          Rotate(x , !f) , Rotate(x , f);
        } else {
          Rotate(y , f) , Rotate(x , f);
        }
      }
    }
    push_up(x);
    if(goal == ) root = x;
  }
  void RotateTo(int k,int goal) {//把第k位的数转到goal下边
    int x = root;
    while(sz[ ch[x][] ] != k) {
      // printf("x = %d k = %d sz[x] = %d\n",x,k,sz[x]);
      if(k < sz[ ch[x][] ]) {
        x = ch[x][];
      } else {
        k -= (sz[ ch[x][] ] + );
        x = ch[x][];
      }
    }
    Splay(x,goal);
  }

  //以上一般不修改//////////////////////////////////////////////////////////////////////////////
  void debug() {
    printf("%d\n",root);
    Treaval(root);
  }
  void Treaval(int x) {
    if(x) {
      Treaval(ch[x][]);
      printf("结点%2d:左儿子 %2d 右儿子 %2d 父结点 %2d size = %2d ,val = %2d\n",x,ch[x][],ch[x][],pre[x],sz[x],val[x]);
      Treaval(ch[x][]);
    }
  }
  //以上Debug
  //以下是题目的特定函数:
  void NewNode(int &x,int c) {
    x = ++top1;
    ch[x][] = ch[x][] = pre[x] = ;
    sz[x] = ;
    val[x] = c;
    sum[x] = c;
    pf[x] = c;
  }
  //把孩子状态更新上来
  void push_up(int x) {
    sz[x] =  + sz[ ch[x][] ] + sz[ ch[x][] ];
    sum[x] = val[x] + sum[ch[x][]] + sum[ch[x][]];

    pf[x] = max(pf[ch[x][]] , sum[ch[x][]] + val[x] + pf[ch[x][]] );
    pf[x] = max(pf[x] , sum[ch[x][]] + val[x]);

    return ;
  }
  /*初始化*/
  void makeTree(int &x,int l,int r,int f) {
    if(l > r) return ;
    int m = (l + r)>>;
    //  NewNode(x , num[m]);        /*num[m]权值改成题目所需的*/
    makeTree(ch[x][] , l , m -  , x);
    makeTree(ch[x][] , m +  , r , x);
    pre[x] = f;
    push_up(x);
  }
  void clear() {
    cnt =  ;
    ch[][] = ch[][] = pre[] = sz[] = ;
    val[] =  sum[] =  ;
    pf[] = -inf;
    root = top1 = ;
    //为了方便处理边界,加两个边界顶点
    NewNode(root , -inf);
    NewNode(ch[root][] , );
    pre[top1] = root;
    sz[root] = ;
  }
  void init(int pos,int n) {
    clear();
    cnt = n;
    RotateTo(pos ,  );
    RotateTo(pos + , root);
    // makeTree(keyTree , 1 , n   , ch[root][1]);
    push_up(ch[root][]);
    push_up(root);
  }
  void insert(int k , int value) {
    cnt ++ ;
    RotateTo(k -  , );
    RotateTo(k , root);
    NewNode(keyTree,value);
    pre[keyTree] = ch[root][];
    push_up(root);
  }
  void del(int k) {
    RotateTo(k -  , );
    RotateTo(k +  , root);
    //printf("val = %d\n",val[keyTree]);
    //printf("sz = %d\n",sz[keyTree]);
    cnt -- ;
    keyTree =  ;
    push_up(root);
    // erase(keyTree);
  }
  int query(int k)
  {
    if(k > cnt) k = cnt;
    RotateTo(,);
    RotateTo(k +  ,root);
    //printf("sz = %d\n",sz[keyTree]);
    return pf[keyTree];
  }
  int cnt ;
  /*这是题目特定变量*/
  int val[maxn];
  int sum[maxn];
  int pf[maxn];
} spt;

int main()
{
  char str[];
  int Q;
  while(scanf("%d",&Q)!=EOF)
  {
    spt.init(,);
    int loc;
    int x;
    loc =  ;
    while(Q -- )
    {
      scanf("%s",str);
      if(str[] == 'I')
      {
        scanf("%d",&x);
        spt.insert(loc +  ,x);
        loc ++ ;
      }
      else if(str[] == 'Q')
      {
        scanf("%d",&x);
        if(x > loc ) x = loc ;
        int ans = spt.query(x);
        printf("%d\n",ans);
      }
      else if(str[] == 'L')
      {
        if(loc >  )
          loc -- ;
      }
      else if(str[] == 'R')
      {
        if(loc < spt.cnt)
          loc ++ ;
      }
      else if(str[] == 'D')
      {
        spt.del(loc);
        loc -- ;
      }
     // spt.debug();
    }
  }
  return ;
}

代码不忍直视

以后补上维护栈的代码