# HDU 4393 Throw nails（技巧性模拟）

The annual school bicycle contest started. ZL is a student in this school. He is so boring because he can't ride a bike!! So he decided to interfere with the contest. He has got the players' information by previous contest video. A player can run F meters ...

# FZU 1857 Clock in the mirror（模拟）

Yr is on the English class,she is so sleepy that she want to know how long the class will last.So,she try to find out the current time.But the only clock is on the back wall of the classroom,and frequent turning might offend the teacher. Clever as she is,...

# SGU 417. Heavy Disc（水题）

Consider a heavy disc on the plane, centered at ( x 0, y 0) with radius r, with the origin strictly outside it. The density of the disc is given by formula What is the mass of the disc?...

# Educational Codeforces Round 32 C. K-Dominant Character（模拟）

You are given a string s consisting of lowercase Latin letters. Character c is called k-dominant iff each substring of s with length at least kcontains this character c. You have to find minimum k such that there exists at least one k-dominant character....

# Educational Codeforces Round 32 B. Buggy Robot（模拟）

Ivan has a robot which is situated on an infinite grid. Initially the robot is standing in the starting cell (0, 0). The robot can process commands. There are four types of commands it can perform: U — move from the cell (x, y) to (x, y + 1); D — move fro...

# Educational Codeforces Round 32 A. Local Extrema（模拟水题）

You are given an array a. Some element of this array ai is a local minimum iff it is strictly less than both of its neighbours (that is, ai < ai - 1and ai < ai + 1). Also the element can be called local maximum iff it is strictly greater than its neighbour...

# CodeForces 337D Book of Evil（双向dfs）

Paladin Manao caught the trail of the ancient Book of Evil in a swampy area. This area contains n settlements numbered from 1 to n. Moving through the swamp is very difficult, so people tramped exactly n - 1 paths. Each of these paths connects some pair of...

# codeforces 315 B.Sereja and Array(线段树区间更新+单点更新+单点询问)

Sereja has got an array, consisting of n integers, a1, a2, ..., an. Sereja is an active boy, so he is now going to complete m operations. Each operation will have one of the three forms: Make vi-th array element equal to xi. In other words, perform the ass...

277条 共19页1 2 3 4 5 ... 下一页 尾页
个人资料
• 访问：39396次
• 积分：2992
• 等级：
• 排名：第12952名
• 原创：270篇
• 转载：7篇
• 译文：0篇
• 评论：16条
ACM战友
最新评论