YORU

摘要： http://acm.hdu.edu.cn/showproblem.php?pid=1671字典树的题目，在POJ上的时候字典树的话会因为不断开辟新的节点而消耗过多的时间，所以会开一个固定的空间.....但是我不知道该开多大的空间....o(╯□╰)o看别人的代码是开到 100000...话说我不知道为什么只要那么点就可以了....Code 1 #include <stdio.h> 2 #include <stdlib.h> 3 #include <string.h> 4 #include <iostream> 5 using namespace 阅读全文

摘要： http://acm.hdu.edu.cn/showproblem.php?pid=4262树状数组更新点的位置，并可以求出两点之间的有多少球View Code 1 #include <stdio.h> 2 #define maxn 100001 3 int ans[maxn], n, b[maxn]; 4 5 int lowbit(int x) 6 { 7 return x & (-x); 8 } 9 10 void mod(int x, int data)11 {12 int i;13 for(i = x; i <= n; i+=lowbit(i))14 ... 阅读全文

摘要： Cinema in AkibaTime Limit:3 Seconds Memory Limit:65536 KBCinema in Akiba (CIA)is a small but very popular cinema inAkihabara. Every night the cinema is full of people. The layout ofCIAis very interesting, as there is only one row so that every audience can enjoy the wonderful movies without any anno 阅读全文