自定义博客皮肤VIP专享

*博客头图:

格式为PNG、JPG,宽度*高度大于1920*100像素,不超过2MB,主视觉建议放在右侧,请参照线上博客头图

请上传大于1920*100像素的图片!

博客底图:

图片格式为PNG、JPG,不超过1MB,可上下左右平铺至整个背景

栏目图:

图片格式为PNG、JPG,图片宽度*高度为300*38像素,不超过0.5MB

主标题颜色:

RGB颜色,例如:#AFAFAF

Hover:

RGB颜色,例如:#AFAFAF

副标题颜色:

RGB颜色,例如:#AFAFAF

自定义博客皮肤

-+

绝尘

菩提本无树,明镜亦非台。 本来无一物,何处惹尘埃!

  • 博客(11)
  • 资源 (4)
  • 问答 (2)
  • 收藏
  • 关注

原创 Just a Hook(HDU1698 线段树的简单应用)

Just a Hook Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Problem Description In 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)

JuQueen Time Limit: 5 Sec  Memory Limit: 512 MB Description   Input   Output   Sample Input 10 10 5 state 0 groupchange 2 9 7 state 9 groupchange 0 2 10 change 0 -5 Sample Ou

2015-10-10 19:56:40 546

原创 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 814

原创 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 760

OCLSDKLightAMD.zip

替代AMD APP SDK的OpenCL的库。OpenCL(全称Open Computing Language,开放运算语言)是第一个面向异构系统通用目的并行编程的开放式、免费标准,也是一个统一的编程环境,便于软件开发人员为高性能计算服务器、桌面计算系统、手持设备编写高效轻便的代码

2019-10-15

MakedownTyproa

Typroa 终于有Linux 版了

2016-12-20

算法合集之最小割模型在信息学竞赛中的应用

Amber的《最小割模型在信息学竞赛中的应用》,描述了分数规划问题,最大密度子图,二分图的最小点权覆盖集与最大点权独立集

2016-02-25

TA创建的收藏夹 TA关注的收藏夹

TA关注的人

提示
确定要删除当前文章?
取消 删除