WZJRJ28

为了看到更大的世界

kudu CFile设计文档个人翻译.

CFile CFile是一种在磁盘上的存放了数据和其相关B-树索引的列式存储结构,在一个DiskRowSet中每一列和DeltaFile都会映射到一个CFile上,此外DIskRowSet的布隆过滤器也会被存储在CFile中,如果这张表含有复合主键,那么与其相关的ad-hoc index也会被存...

2018-08-26 22:06:40

阅读数:61

评论数:0

“今日头条杯”首届湖北省大学程序设计竞赛 网络赛-E.Jump A Jump(取模最短路)

Problem DescriptionThere's a very popular game called jump a jump recently.In order to get good marks, many people spend a lot of time in this game.W...

2018-04-21 15:24:38

阅读数:349

评论数:0

[杂/退役了]ACM生涯再见

今年ecfinal过后以后就要和这个比赛说再见了,没想到靠着最后一场原本都不报任何希望的ecfinal拿到了第一块icpc金牌(之前几场ICPC都各种奇妙原因翻车).....现在CCPC和ICPC都有了au,也算是圆满退役了,以后再和算法竞赛有什么关系也只能是找时间打打cf了(虽然好像已经快一年没...

2017-12-27 20:56:20

阅读数:292

评论数:0

Hdu-6183 Color it(cdq分治)

Do you like painting? Little D doesn't like painting, especially messy color paintings. Now Little B is painting. To prevent him from drawing messy p...

2017-10-31 17:59:36

阅读数:168

评论数:0

Codeforces Round #441 (Div. 1, by Moscow Team Olympiad) D. High Cry

Disclaimer: there are lots of untranslateable puns in the Russian version of the statement, so there is one more reason for you to learn Russian :) ...

2017-10-26 19:10:49

阅读数:116

评论数:0

UVALive - 7042 The Problem to Make You Happy(博弈/bfs)

分析: 之前没怎么做过博弈相关的题目,一开始还以为是道复杂的分类讨论,设状态i,j,k表示当前Alice在i点Bob再j点且这一步轮到Alice/Bob操作,若dp[i][j][k]为1则表示Bob必败,那么我们考虑边界必败状态,一是两个点重叠在一起,二是现在轮到Bob操作而且Bob到了一个出度为...

2017-10-18 19:51:05

阅读数:173

评论数:0

Hdu-5016 Mart Master II(点分治+二分)

Trader Dogy lives in city S, which consists of n districts. There are n - 1 bidirectional roads in city S, each connects a pair of districts. Indeed,...

2017-10-18 09:46:58

阅读数:156

评论数:0

Hdu-5126 stars(cdq分治)

John loves to see the sky. A day has Q times. Each time John will find a new star in the sky, or he wants to know how many stars between (x1,y1,z1) ...

2017-10-09 14:38:03

阅读数:197

评论数:0

ACM-ICPC国际大学生程序设计竞赛北京赛区(2017)网络赛 Agent Communication(图论)

描述 In Peking University, there are many homeless cats. The students of cat club built n nests and some paths for those cats. A path connects two nes...

2017-09-25 19:39:05

阅读数:381

评论数:0

BSUIR Open 2017 Finals Financial Reports(线段树)

题意:10^5的数列,让你交换两个数,使得交换后的数列的连续区间最大和最大。 分析:我们假设最优解是交换u 和 v,u >= v,那么交换后的最优解应该是以交换后u向左右两端分别扩展的一段区间,和u之前位置异侧的最大扩展值可以O(n)的DP预处理出来,然后我们考虑和u之前位置(也就...

2017-09-23 00:34:13

阅读数:154

评论数:0

2017 ACM-ICPC 亚洲区(乌鲁木齐赛区)网络赛 D. Hack Portals(区间DP)

We all have much to be proud of. As a player of the game Ingress, IloveMATH is proud of these portals on the road in front of his campus. Here is a...

2017-09-21 20:31:42

阅读数:249

评论数:0

Hdu-6212 Zuma(区间DP)

Think about the Zuma Game. You have a row of at most 200 black(0) or white(1) balls on the table at the start. Each three consecutive balls neve...

2017-09-20 12:38:00

阅读数:223

评论数:0

2017 ACM-ICPC 亚洲区(西安赛区)网络赛 E. Maximum Flow

Given a directed graph with nnn nodes, labeled 0,1,⋯,n−10,1, \cdots, n-10,1,⋯,n−1. For each i,j> satisfies 0≤i0≤ijn, there exists an edge f...

2017-09-16 21:56:39

阅读数:159

评论数:0

Educational Codeforces Round 27 E. Fire in the City(二维离散化)

The capital of Berland looks like a rectangle of size n × m of the square blocks of same size. Fire! It is known that k + 1 blocks got caught on fi...

2017-09-16 10:18:55

阅读数:136

评论数:0

CodeForces - 842C Ilya And The Tree(树上倍增)

Ilya is very fond of graphs, especially trees. During his last trip to the forest Ilya found a very interesting tree rooted at vertex 1. There is an...

2017-09-15 16:14:14

阅读数:148

评论数:0

2017 ACM-ICPC 亚洲区(乌鲁木齐赛区)网络赛 Colored Graph(贪心构造)

In graph theory, graph colouring is a special case of graph labelling. It is an assignment of labels traditionally called colours to edges of a grap...

2017-09-14 00:02:30

阅读数:113

评论数:0

Hdu-6200 mustedge mustedge mustedge(动态树+并查集)

Give an connected undirected graph with n nodes and m edges, (n,m≤105) which has no selfloops or multiple edges initially. Now we have...

2017-09-11 15:42:17

阅读数:236

评论数:0

HYSBZ - 2959 长跑(动态树+并查集)

某校开展了同学们喜闻乐见的阳光长跑活动。为了能“为祖国健康工作五十年”,同学们纷纷离开寝室,离开教室,离开实验室,到操场参加3000米长跑运动。一时间操场上熙熙攘攘,摩肩接踵,盛况空前。   为了让同学们更好地监督自己,学校推行了刷卡机制。   学校中有n个地点,用1到n的整数表示,每个地点设...

2017-09-11 10:46:26

阅读数:140

评论数:0

Codeforces Round #429 (Div. 1) D. Destiny(主席树)

D. Destiny time limit per test 2.5 seconds memory limit per test 512 megabytes input standard input output standard output ...

2017-08-25 17:08:05

阅读数:201

评论数:0

Hdu-6133 Army Formations(线段树合并)

Though being cruel and merciless in the battlefields, the total obedience to the command hierarchy makes message delivering between Stormtroopers qui...

2017-08-19 20:31:50

阅读数:450

评论数:4

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