2012 ACM/ICPC Asia Regional Chengdu Online-hdu 4288
来源:互联网 发布:蓝牙单片机程序 编辑:程序博客网 时间:2024/05/21 08:40
//离线线段树上的子节点到父节点的状态转移,转移方程为:btree[i].sum[j]=btree[i<<1].sum[j]+btree[i<<1|1].sum[(j+5-(btree[i<<1].cnt)%5)%5];
//代码如下:
#include <stdio.h>#include <string.h>#include <map>#include <algorithm>using namespace std;#define N 100010struct tree{ __int64 sum[5]; int cnt;}btree[4*N];int num[N];void build(int i,int l,int r){ int j,mid=(l+r)>>1; for(j=0;j<5;j++) btree[i].sum[j]=0; btree[i].cnt=0; if(l==r)return; else { build(i<<1,l,mid); build(i<<1|1,mid+1,r); }}void update(int i,int l,int r,int p,int v){ int mid=(l+r)>>1,j; btree[i].cnt+=v; if(l==r) { if(btree[i].cnt) btree[i].sum[1]=num[p]; else btree[i].sum[1]=0; return; } else { if(p<=mid)update(i<<1,l,mid,p,v); else update(i<<1|1,mid+1,r,p,v); } for(j=0;j<5;j++) btree[i].sum[j]=btree[i<<1].sum[j]+btree[i<<1|1].sum[(j+5-(btree[i<<1].cnt)%5)%5];}struct node{ int type; int d;}data[N];int main (void){ char op[5]; int n,i,ant; while (scanf( "%d", &n )!=EOF) { ant=0; map <int,int> p; for(i=1;i<=n;i++) { scanf("%s",op); if(!strcmp(op,"add")) { data[i].type=1; scanf("%d",&data[i].d); num[ant++]=data[i].d; } else if(!strcmp(op,"del")) { scanf("%d",&data[i].d); data[i].type=2; } else data[i].type=3; } sort(num,num+ant); for(i=0;i<ant;i++) p[num[i]]=i; build(1,1,ant); for(i=1;i<=n;i++) { if(data[i].type==1) { update(1,1,ant,p[data[i].d],1); } else if(data[i].type==2) { update(1,1,ant,p[data[i].d],-1); } else { printf("%I64d\n",btree[1].sum[3]); } } } return 0;}
- 2012 ACM/ICPC Asia Regional Chengdu Online-hdu 4288
- 2012 ACM/ICPC Asia Regional Chengdu Online-hdu-4289
- hdu 4288 Coder (2012 ACM/ICPC Asia Regional Chengdu Online)
- 2013 ACM/ICPC Asia Regional Chengdu Online
- 2013 ACM/ICPC Asia Regional Chengdu Online
- 2013 ACM/ICPC Asia Regional Chengdu Online
- 2012 ACM/ICPC Asia Regional Chengdu Online(hdu4291)
- 2012 ACM/ICPC Asia Regional Chengdu Online(hdu4292)
- hdu 4293 Groups (2012 ACM/ICPC Asia Regional Chengdu Online)
- 2013 ACM/ICPC Asia Regional Chengdu Online 个人总结
- 2013 ACM/ICPC Asia Regional Chengdu Online---1003
- 2013 ACM/ICPC Asia Regional Chengdu Online 1004 Minimum palindrome
- HDU 4034 Graph The 36th ACM/ICPC Asia Regional Chengdu Site —— Online Contest
- HDU 4038 Stone The 36th ACM/ICPC Asia Regional Chengdu Site —— Online Contest
- hdu 4731 Minimum palindrome 找规律 (2013 ACM/ICPC Asia Regional Chengdu Online 1004)
- hdu 4737 A Bit Fun 数列(2013 ACM/ICPC Asia Regional Chengdu Online 1010)
- 2013 ACM/ICPC Asia Regional Chengdu Online HDU 4731 Minimum palindrome(规律)
- hdu 4734 F(x) 数位dp (2013 ACM/ICPC Asia Regional Chengdu Online 1007)
- POCO C++解析之一 一般线程
- IOS学习之UINavigationController详解与使用(三)ToolBar
- vs2008 配置 wxWidgets-2.9.4
- zend studio 9.0.3 破解与汉化
- HDU 2574 素数因子数目
- 2012 ACM/ICPC Asia Regional Chengdu Online-hdu 4288
- 解题报告-HDOJ-1232(并查集)
- validation
- Android Gallery实现滑动翻页效果
- 进程间通信——管道
- 编写守护进程
- WebService 之 WSDL文件 讲解
- Linux基础命令学习小结
- XCODE中为单独的文件设置不支持ARC的方法