- 博客(11)
- 资源 (4)
- 问答 (2)
- 收藏
- 关注
RSS订阅原创 Just a Hook(HDU1698 线段树的简单应用)
Just a HookTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Problem DescriptionIn the game of DotA, Pudge’s meat hook is actually the most horrible thing fo
2015-10-22 19:29:58
452
原创 覆盖的面积(HDU 1255 线段树)
覆盖的面积Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Problem Description给定平面上若干矩形,求出被这些矩形覆盖过至少两次的区域的面积. Input输入数据的第一行是一个正整数T(1注意:本题的输入
2015-10-13 20:49:43
658
原创 Prime Query (ZOJ 3911 线段树)
Prime Query Time Limit: 1 Second Memory Limit: 196608 KBYou are given a simple task. Given a sequence A[i] with N numbers. You have to perform Q operations on the given sequence.Here are the oper
2015-10-13 19:11:04
652
原创 JuQueen(线段树 lazy)
JuQueenTime Limit: 5 Sec Memory Limit: 512 MBDescription Input Output Sample Input10 10 5state 0groupchange 2 9 7state 9groupchange 0 2 10change 0 -5Sample Ou
2015-10-10 19:56:40
547
原创 2015弱校联盟(2) - J. Usoperanto
J. Usoperanto Time Limit: 8000ms Memory Limit: 256000KBUsoperanto is an artificial spoken language designed and regulated by Usoperanto Academy. The academy is now in study to establish Strict Usoper
2015-10-02 20:12:39
456
原创 2015弱校联盟(1) - C. Censor
C. Censor Time Limit: 2000ms Memory Limit: 65536KBfrog is now a editor to censor so-called sensitive words (敏感词).She has a long text p. Her job is relatively simple – just to find the first occurence
2015-10-02 13:34:02
905
原创 2015弱校联盟(1) - B. Carries
B. Carries Time Limit: 1000ms Memory Limit: 65536KBfrog has n integers a1,a2,…,an, and she wants to add them pairwise.Unfortunately, frog is somehow afraid of carries (进位). She defines \emph{hardness
2015-10-02 08:09:19
815
原创 2015弱校联盟(1) - I. Travel
I. Travel Time Limit: 3000ms Memory Limit: 65536KBThe country frog lives in has n towns which are conveniently numbered by 1,2,…,n.Among n(n−1)/2 pairs of towns, m of them are connected by bidirectio
2015-10-01 21:18:18
751
原创 2015弱校联盟(1) -J. Right turn
J. Right turn Time Limit: 1000ms Memory Limit: 65536KBfrog is trapped in a maze. The maze is infinitely large and divided into grids. It also consists of n obstacles, where the i-th obstacle lies in
2015-10-01 19:59:07
732
原创 2015弱校联盟(1) -A. Easy Math
A. Easy Math Time Limit: 2000ms Memory Limit: 65536KBGiven n integers a1,a2,…,an, check if the sum of their square root a1−−√+a2−−√+⋯+an−−√ is a integer. Input The input consists of multiple tests.
2015-10-01 19:06:14
995
原创 2015弱校联盟(1) - E. Rectangle
E. Rectangle Time Limit: 1000ms Memory Limit: 65536KB 64-bit integer IO format: %lld Java class name: Main Submit Status frog has a piece of paper divided into n rows and m columns. Today, sh
2015-10-01 18:56:50
761
OCLSDKLightAMD.zip
2019-10-15
ZOJ2676最小割01规划问题
2016-02-25
最小割在图论中的应用问题
2016-02-24
TA创建的收藏夹 TA关注的收藏夹
TA关注的人