zoukankan
html css js c++ java
NUAA上次热身赛的题目
自己用线段树写了一遍
还需...
#include
<
stdio.h
>
#include
<
math.h
>
#include
<
string
.h
>
struct
node
{
int
left, right;
node
*
pl,
*
pr;
int
height;
int
hCount;
int
Lheight, Rheight;
}
line[
80002
];
int
n;
int
lineCount;
int
point[
80002
];
int
area;
node
*
newNode()
{
node
*
pt
=
&
line[lineCount
++
];
memset(pt,
0
,
sizeof
(node));
return
pt;
}
node
*
makeTree(
int
ileft,
int
iright)
{
node
*
root
=
newNode();
root
->
left
=
ileft;
root
->
right
=
iright;
if
(iright
-
ileft
>
1
)
{
int
mid
=
(ileft
+
iright)
/
2
;
root
->
pl
=
makeTree(ileft,mid);
root
->
pr
=
makeTree(mid,iright);
}
return
root;
}
void
height(node
*
root,
int
height)
{
root
->
height
=
height;
root
->
Lheight
=
root
->
Rheight
=
height;
}
void
update(node
*
root,
int
x1,
int
x2,
int
h)
{
if
(root
->
left
==
x1
&&
root
->
right
==
x2)
{
height(root,h);
return
;
}
if
(root
->
hCount
==
1
)
{
height(root
->
pl,root
->
height);
height(root
->
pr,root
->
height);
}
root
->
hCount
++
;
if
(root
->
pl
->
right
>
x1)
{
if
(root
->
pl
->
right
>
x2)
update(root
->
pl,x1,x2,h);
else
{
int
mid
=
(root
->
left
+
root
->
right)
/
2
;
update(root
->
pl,x1,mid,h);
update(root
->
pr,mid,x2,h);
}
}
else
{
update(root
->
pr,x1,x2,h);
}
root
->
Lheight
=
root
->
pl
->
Lheight;
root
->
Rheight
=
root
->
pr
->
Rheight;
}
void
count(node
*
root,
int
x1,
int
x2)
{
if
(root
->
hCount
==
1
)
{
area
+=
(root
->
right
-
root
->
right)
*
root
->
height;
return
;
}
if
(root
->
right
-
root
->
left
<=
1
||
root
->
hCount
==
0
)
return
;
if
(root
->
pl
->
right
>
x1)
{
if
(root
->
pl
->
right
>=
x2)
{
count(root
->
pl,x1,x2);
}
else
{
int
mid
=
(root
->
left
+
root
->
right)
/
2
;
count(root
->
pl,x1,mid);
count(root
->
pr,mid,x2);
}
}
else
{
count(root
->
pr,x1,x2);
}
}
int
main()
{
lineCount
=
0
;
node
*
root
=
makeTree(
0
,
8002
);
while
(scanf(
"
%d
"
,
&
n)
!=
EOF
&&
n)
{
area
=
0
;
int
x1, x2, h;
int
i;
for
(i
=
0
;i
<
n;i
++
)
line[i].hCount
=
line[i].height
=
line[i].Lheight
=
line[i].Rheight
=
0
;
for
(i
=
0
;i
<
n;i
++
)
{
scanf(
"
%d%d%d
"
,
&
x1,
&
x2,
&
h);
update(root,x1,x2,h);
}
count(root,
0
,
8002
);
printf(
"
%d\n
"
,area);
}
return
0
;
}
查看全文
相关阅读:
javascript中Function、ArrowFunction和GeneratorFunction介绍
javascript中Function、ArrowFunction和GeneratorFunction介绍
26个ASP.NET常用性能优化方法
xgqfrms™, xgqfrms® : xgqfrms's offical website of GitHub!
xgqfrms™, xgqfrms® : xgqfrms's offical website of GitHub!
xgqfrms™, xgqfrms® : xgqfrms's offical website of GitHub!
什么是去中心化市场(OpenBazaar)
去中心化共识
侧链/楔入式侧链
零知识证明(Zero Knowledge Proof,ZKP)
原文地址:https://www.cnblogs.com/SQL/p/920172.html
最新文章
xgqfrms™, xgqfrms® : xgqfrms's offical website of GitHub!
xgqfrms™, xgqfrms® : xgqfrms's offical website of GitHub!
闪电网络详解
铸币交易/币基交易
UTXO
矿池是什么
托管矿池
P2P矿池
去中心化组织
去中心化自治组织(decentralized autonomous organization,DAO)
热门文章
自动代理(automated agent,AA)
去中心化自治企业(decentralized autonomous corporation,DAC)
OC KVC
OC KVC
OC KVC
OC KVC
iOS自定义tabBar
iOS自定义tabBar
iOS自定义tabBar
iOS自定义tabBar
Copyright © 2011-2022 走看看