自定义博客皮肤VIP专享

*博客头图:

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

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

博客底图:

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

栏目图:

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

主标题颜色:

RGB颜色,例如:#AFAFAF

Hover:

RGB颜色,例如:#AFAFAF

副标题颜色:

RGB颜色,例如:#AFAFAF

自定义博客皮肤

-+

JUST CODE

Living at Dawn

  • 博客(21)
  • 收藏
  • 关注

原创 解题报告 之 HDU5336 XYZ and Drops

DescriptionXYZ is playing an interesting game called "drops". It is played on a grid. Each grid cell is either empty, or occupied by a waterdrop. Each waterdrop has a property "size". The waterdrop cracks when its size is larger than 4, and produces 4 sm

2015-08-28 10:03:05 1087

原创 解题报告 之 HDU5335 Walk Out

bfs,多校,HDU5335In an maze, the right-bottom corner is the exit (position is the exit). In every position of this maze, there is either a or a written on it. An explorer gets lost in this grid. His position now is , and he wants to go to the exit. Sin

2015-08-27 16:02:07 1051

原创 解题报告 之 HDU5334 Virtual Participation

Description 构造,数论,数学As we know, Rikka is poor at math. Yuta is worrying about this situation, so he asks rikka to have some practice on codeforces. Then she opens the problem B: Given an integer , she needs to come up with an sequence of integers satis

2015-08-27 14:52:11 780

原创 解题报告 之 HDU5328 Problem Killer

You are a "Problem Killer", you want to solve many problems. Now you have problems, the -th problem's difficulty is represented by an integer (). For some strange reason, you must choose some integer and (), and solve the problems between the -th and

2015-08-27 14:21:11 1131

原创 解题报告 之 HDU5327 Olympiad

You are one of the competitors of the Olympiad in numbers. The problem of this year relates to beatiful numbers. One integer is called beautiful if and only if all of its digitals are different (i.e. 12345 is beautiful, 11 is not beautiful and 100 is not b

2015-08-27 14:06:45 685

原创 解题报告 之 HDU5326 Work

HDU5326 图论基础It’s an interesting experience to move from ICPC to work, end my college life and start a brand new journey in company. As is known to all, every stuff in a company has a title, everyone except the boss has a direct leader, and all the relat

2015-08-27 13:58:01 891

原创 解题报告 之 HDU5325 Crazy Bobo

解题报告 之 HDU5325 Crazy Bobo 深搜,图论,HDU5325DescriptionBobo has a tree,whose vertices are conveniently labeled by 1,2,...,n.Each node has a weight . All the weights are distrinct. A set with m nodes is a Bobo Set if: - The subgraph of his tree induced by

2015-08-27 13:49:29 998

原创 解题报告 之 HDU5319 Painter

DescriptionMr. Hdu is an painter, as we all know, painters need ideas to innovate , one day, he got stuck in rut and the ideas dry up, he took out a drawing board and began to draw casually. Imagine the board is a rectangle, consists of several square gri

2015-08-24 00:45:14 1568

原创 解题报告 之 2015蓝桥杯 垒骰子

赌圣 atm 晚年迷恋上了垒骰子,就是把骰子一个垒在另一个上边,不能歪歪扭扭,要垒成方柱体。经过长期观察,atm 发现了稳定骰子的奥秘:有些数字的面贴着会互相排斥!我们先来规范一下骰子:1 的对面是 4,2 的对面是 5,3 的对面是 6。假设有 m 组互斥现象,每组中的那两个数字的面紧贴在一起,骰子就不能稳定的垒起来。atm 想计算一下有多少种不同的可能的垒骰子方式。两种垒骰子方式相同,当且仅当这两种方式中对应高度的骰子的对应数字的朝向都相同。由于方案数可能过多,请输出模 10^9 + 7 的

2015-08-24 00:44:31 4308 2

原创 解题报告 之 HDU5323 Solve this interesting problem

Description 搜索,dfs,线段树逆推,剪枝。Have you learned something about segment tree? If not, don’t worry, I will explain it for you. Segment Tree is a kind of binary tree, it can be defined as this: - For each node u in Segment Tree, u has two values: and . - I

2015-08-24 00:42:52 1233

原创 解题报告 之 HDU5318 The Goddess Of The Moon

解题报告 之 HDU5318 The Goddess Of The MoonDescriptionChang’e (嫦娥) is a well-known character in Chinese ancient mythology. She’s the goddess of the Moon. There are many tales about Chang'e, but there's a well-known story regarding the origin of the Mid-Autum

2015-08-23 11:36:56 1151

原创 解题报告 之 HDU5317 RGCDQ

解题报告 之 HDU5317 RGCDQDescription 筛法,数论,观察Mr. Hdu is interested in Greatest Common Divisor (GCD). He wants to find more and more interesting things about GCD. Today He comes up with Range Greatest Common Divisor Query (RGCDQ). What’s RGCDQ? Please let me

2015-08-23 10:53:15 840

原创 解题报告 之 HDU5316 Magician

HDU5316 Magician线段树 点的信息 数据结构 多校

2015-08-23 10:36:38 1012

原创 解题报告 之 HDU5305 Friends

爆搜,剪枝解题报告 之 HDU5305 FriendsDescriptionThere are people and pairs of friends. For every pair of friends, they can choose to become online friends (communicating using online applications) or offline friends (mostly using face-to-face communication). H

2015-08-23 01:55:58 929

原创 解题报告 之 HDU5303 Delicious Apples

Description 思维,好题,枚举,离散化There are $n$ apple trees planted along a cyclic road, which is $L$ metres long. Your storehouse is built at position $0$ on that cyclic road. The $i$th tree is planted at position $x_i$, clockwise from position $0$. There are $a

2015-08-23 00:57:56 1280

原创 解题报告 之 HDU5301 Buildings

解题报告 之 HDU5301 BuildingsDescriptionYour current task is to make a ground plan for a residential building located in HZXJHS. So you must determine a way to split the floor building with walls to make apartments in the shape of a rectangle. Each built wal

2015-08-19 00:22:07 1234

原创 解题报告 之 CodeForces 6E Exposition

解题报告 之 CodeForces 6E ExpositionDescriptionThere are several days left before the fiftieth birthday of a famous Berland's writer Berlbury. In this connection the local library decided to make an exposition of the works of this famous science-fiction writ

2015-08-18 23:51:00 1565 1

原创 解题报告 之 HDU5294 Tricks Device

解题报告 之 HDU5294 Tricks DeviceDescriptionInnocent Wu follows Dumb Zhang into a ancient tomb. Innocent Wu’s at the entrance of the tomb while Dumb Zhang’s at the end of it. The tomb is made up of many chambers, the total number is N. And there are M channe

2015-08-16 12:54:29 751

原创 解题报告 之 HDU5289 Assignment

解题报告 之 HDU5289 AssignmentDescriptionTom owns a company and he is the boss. There are n staffs which are numbered from 1 to n in this company, and every staff has a ability. Now, Tom is going to assign a special task to some staffs who were in the same g

2015-08-13 14:57:05 1463

原创 解题报告 之 HDU5288 OO' s Sequence

解题报告 之 HDU5288 OO' s Sequence

2015-08-13 14:26:16 906

转载 BaseAdapter——convertView回收机制与动态控件响应

前言:对于listView的BaseAdapter的派生,难度比较大。最难理解的莫过于getView(int position, View convertView, ViewGroup parent)这个函数是如何产生每条记录的,有些博客中利用holderView,有些博客却没有用,种种方法之间有什么异同,今天我们就来揭开这个绘制ITEM机制的面纱。本篇借助《PullToRefresh

2015-08-11 21:53:40 674

空空如也

空空如也

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

TA关注的人

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