HDU 1166
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1166
java 全部超时,不知道为什么 求大神讲解
线段树
import java.util.Scanner;
public class test1166 {
private static int[] score = new int[50010];
private static int[] sum = new int[200010];
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
while (in.hasNext()) {
int T = in.nextInt();
int num = 1;
while (T-- > 0) {
int N = in.nextInt();
for (int i = 1; i <= N; i++) {
score[i] = in.nextInt();
}
System.out.println("Case " + (num++) + ":");
Build(1, N, 1);
while (true) {
String cmd = in.next();
int a, b;
if (!cmd.equals("End")) {
a = in.nextInt();
b = in.nextInt();
} else {
break;
}
if (cmd.equals("Query")) {
if (a == b) {
System.out.println(score[a]);
} else {
int n = Query(a, b, 1, N, 1);
System.out.println(n);
}
} else {
if (cmd.equals("Add")) {
score[a] = score[a] + b;
Update(a, b, 1, N, 1);
} else {
score[a] = score[a] + b;
Update(a, -b, 1, N, 1);
}
}
}
}
}
}
// L,R 操作區間,l r 當前區間 pos 当前位置
private static int Query(int L, int R, int l, int r, int pos) {
if (L <= l && r <= R) {
return sum[pos];
}
int m = (l + r) >> 1;
int ANS = 0;
if (L <= m) {
ANS += Query(L, R, l, m, pos << 1);
}
if (R > m) {
ANS += Query(L, R, m + 1, r, pos << 1 | 1);
}
return ANS;
}
// L 操作區間 value 修改的值 l r當前區間 pos當前位置
private static void Update(int L, int value, int l, int r, int pos) {
if (l == r) {
sum[pos] += value;
return;
}
int mid = (l + r) >> 1;
if (L <= mid) {
Update(L, value, l, mid, pos << 1);
} else if (L > mid) {
Update(L, value, mid + 1, r, pos << 1 | 1);
}
sum[pos] = sum[pos << 1] + sum[pos << 1 | 1];
}
private static void Build(int l, int r, int pos) {
if (l == r) {
sum[pos] = score[l];
return;
}
int mid = (l + r) >> 1;
Build(l, mid, pos << 1);
Build(mid + 1, r, pos << 1 | 1);
sum[pos] = sum[pos << 1] + sum[pos << 1 | 1];
}
}
树状数组
import java.util.Scanner;
public class test1166BIT {
private static int N;
private static int[] tree = new int[50100];
public static int lowbit(int x) {
return x & (-x);
}
public static int getsum(int pos) {
int res = 0;
while (pos > 0) {
res += tree[pos];
pos -= lowbit(pos);
}
return res;
}
public static void add(int pos, int num) {
while (pos <= N) {
tree[pos] += num;
pos += lowbit(pos);
}
}
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
while (in.hasNext()) {
int T = in.nextInt();
int num = 1;
while (T-- > 0) {
N = in.nextInt();
for (int i = 1; i <= N; i++) {
int tem = in.nextInt();
add(i, tem);
}
System.out.println("Case " + (num++) + ":");
while (true) {
String cmd = in.next();
int a, b;
if (!cmd.equals("End")) {
a = in.nextInt();
b = in.nextInt();
} else {
break;
}
if (cmd.equals("Query")) {
System.out.println(getsum(b) - getsum(a - 1));
} else {
if (cmd.equals("Add")) {
add(a, b);
} else {
add(a, -b);
}
}
}
}
}
}
}
树状数组(Binary Indexed Tree(BIT), Fenwick Tree)是一个查询和修改复杂度都为log(n)的数据结构。
主要用于查询任意两位之间的所有元素之和,但是每次只能修改一个元素的值;经过简单修改可以在log(n)的复杂度下进行范围修改,但是这时只能查询其中一个元素的值(如果加入多个辅助数组则可以实现区间修改与区间查询)。
这种数据结构(算法)并没有C++和Java的库支持,需要自己手动实现。在Competitive Programming的竞赛中被广泛的使用。树状数组和线段树很像,但能用树状数组解决的问题,基本上都能用线段树解决,而线段树能解决的树状数组不一定能解决。相比较而言,树状数组效率要高很多。