title

随笔分类 -  数据结构

摘要:无原题地址 线段树 (segmenttree.c/cpp/pas) Input file: segmenttree.in Output file: segmenttree.out Time Limit : 3 seconds Memory Limit: 512 megabytes 线段树(Segme 阅读全文
posted @ 2018-09-17 21:51 Horrigue_JyowYang 阅读(238) 评论(0) 推荐(0)
摘要:这里用到了倍增的思想 include include include include using namespace std; int n,m; int dp[100001][20]; int read(){ int f=1,x=0;char s=getchar(); while(s'9'){if( 阅读全文
posted @ 2018-09-10 01:38 Horrigue_JyowYang 阅读(117) 评论(0) 推荐(0)
摘要:懒标记+乘法 include include include include define int long long using namespace std; int n,m; int ans,p,num[3000100]; struct Node{ int l,r,num; int sum,la 阅读全文
posted @ 2018-09-10 01:34 Horrigue_JyowYang 阅读(144) 评论(0) 推荐(0)
摘要:1、区间查单点加 include include using namespace std; const int N =500010; int n,m,a[N],c[N]; inline int read(){ int f=0,x=0; char ch=getchar(); while(!isdigi 阅读全文
posted @ 2018-09-10 01:29 Horrigue_JyowYang 阅读(82) 评论(0) 推荐(0)