# uva3143Fast Matrix Operations（线段树）

315人阅读 评论(0)

1.将某子矩阵的值全部加v

2.将某子矩阵的值全部变为v

3.输出某子矩阵的最大值最小值及总和。

import java.io.BufferedReader;
import java.io.IOException;
import java.io.StreamTokenizer;
import java.util.Arrays;

public class FastMatrix {
class SegTree {
class node {
int left, right;
boolean flag;
int sum, max, min;

final int mid() {
return (left + right) >> 1;
}

final int length() {
return right - left + 1;
}

final void init(int k) {
sum = length() * k;
max = min = k;
}

min += k;
max += k;
sum += length() * k;
}
}

node tree[];
SegTree(int maxn) {
tree = new node[maxn * 3];
}

final void init(int left, int right, int idx) {
tree[idx] = new node();
tree[idx].left = left;
tree[idx].right = right;
if (left == right)
return;
int mid = tree[idx].mid();
init(left, mid, idx << 1);
init(mid + 1, right, (idx << 1) | 1);
}

final int[] query(int left, int right, int idx) {
pushdown(idx);
int ans[] = new int[3];
if (tree[idx].left == left && tree[idx].right == right) {
ans[0] = tree[idx].sum;
ans[1] = tree[idx].min;
ans[2] = tree[idx].max;
return ans;
}
int mid = tree[idx].mid();
if (right <= mid)
return query(left, right, idx << 1);
else if (left > mid)
return query(left, right, (idx << 1) | 1);
else {
int ans1[] = query(left, mid, idx << 1);
int ans2[] = query(mid + 1, right, (idx << 1) | 1);
ans[0] = ans1[0] + ans2[0];
ans[1] = Math.min(ans1[1], ans2[1]);
ans[2] = Math.max(ans1[2], ans2[2]);
return ans;
}
}

final void update(int left, int right, int idx, int op, int v) {
// It's a sub-interval, update it here.
pushdown(idx);
if (left <= tree[idx].left && right >= tree[idx].right) {
if (op == 1)
by(idx, v);
else
to(idx, v);
return;
}
int mid = tree[idx].mid();
if (left <= mid)
update(left, right, idx << 1, op, v);
if (mid < right)
update(left, right, (idx << 1) | 1, op, v);
pushup(idx);
}

final void pushup(int idx) {
if (tree[idx].left == tree[idx].right)
return;
pushdown(idx << 1);
pushdown((idx << 1) | 1);
tree[idx].sum = tree[idx << 1].sum + tree[(idx << 1) | 1].sum;
tree[idx].max = Math.max(tree[idx << 1].max,
tree[(idx << 1) | 1].max);
tree[idx].min = Math.min(tree[idx << 1].min,
tree[(idx << 1) | 1].min);
}

final void pushdown(int idx) {
int v = tree[idx].val;
boolean temp = tree[idx].flag;
if (temp || a != 0) {
if (tree[idx].flag)
tree[idx].init(v);
if (a != 0)
tree[idx].flag = false;
if (tree[idx].left != tree[idx].right) {
int t = idx << 1;
if (temp)
to(t, v);
by(t, a);
t++;
if (temp)
to(t, v);
by(t, a);
}
}
}

final void by(int idx, int k) {
}

final void to(int idx, int k) {
tree[idx].flag = true;
tree[idx].val = k;
}
}

StreamTokenizer in = new StreamTokenizer(new BufferedReader(

int next() throws IOException {
in.nextToken();
return (int) in.nval;
}

SegTree st[] = new SegTree[21];

void run() throws IOException {
for (int i = 1; i <= 20; i++)
st[i] = new SegTree(100010);
while (in.nextToken() != in.TT_EOF) {
int r = (int) in.nval;
int c = next();
int m = next();
for (int i = 1; i <= r; i++) {
st[i].init(1, c, 1);
}
while (m-- > 0) {
int op = next();
int ax = next();
int ay = next();
int bx = next();
int by = next();
if (op == 1 || op == 2) {
int v = next();
for (int i = ax; i <= bx; i++)
st[i].update(ay, by, 1, op, v);
} else {
int sum = 0;
int max = -1999999999;
int min = 1999999999;
for (int i = ax; i <= bx; i++) {
int ans[] = st[i].query(ay, by, 1);
sum += ans[0];
min = Math.min(min, ans[1]);
max = Math.max(max, ans[2]);
}
System.out.println(sum + " " + min + " " + max);
}
}
}
}

public static void main(String[] args) throws IOException {
// TODO Auto-generated method stub
new FastMatrix().run();
}

}

0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：111299次
• 积分：1883
• 等级：
• 排名：千里之外
• 原创：75篇
• 转载：6篇
• 译文：0篇
• 评论：28条
评论排行
时间