2013年11月17日

P - Psychos in a Line 单调队列

摘要: P -Psychos in a LineTime Limit:1000MSMemory Limit:262144KB64bit IO Format:%I64d & %I64uSubmitStatusAppoint description:DescriptionThere arenpsychos standing in a line. Each psycho is assigned a unique integer from1ton. At each step every psycho who has an id greater than the psycho to his right 阅读全文

posted @ 2013-11-17 15:53 keep trying 阅读(254) 评论(0) 推荐(0) 编辑

2013年11月16日

H - Purification 模拟构造

摘要: H -PurificationTime Limit:1000MSMemory Limit:262144KB64bit IO Format:%I64d & %I64uSubmitStatusAppoint description:DescriptionYou are an adventurer currently journeying inside an evil temple. After defeating a couple of weak zombies, you arrived at a square room consisting of tiles forming ann &# 阅读全文

posted @ 2013-11-16 21:02 keep trying 阅读(193) 评论(0) 推荐(0) 编辑

C. Insertion Sort DP

摘要: C. Insertion Sorttime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputPetya is a beginner programmer. He has already mastered the basics of the C++ language and moved on to learning algorithms. The first algorithm he encountered was insertion sort. Pe 阅读全文

posted @ 2013-11-16 09:23 keep trying 阅读(260) 评论(0) 推荐(0) 编辑

2013年11月15日

A. Two Semiknights Meet DFS

摘要: A. Two Semiknights Meettime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputA boy Petya loves chess very much. He even came up with a chess piece of his own, a semiknight. The semiknight can move in any of these four directions:2squares forward and2squ 阅读全文

posted @ 2013-11-15 20:39 keep trying 阅读(313) 评论(0) 推荐(0) 编辑

Dummy Guy 几何

摘要: Dummy GuyTime Limit:500MSMemory Limit:65536KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeURAL 1984DescriptionEvery year students of our university participate in Regional Contest in Saint Petersburg. Train journeys from Yekaterinburg to Saint Petersburg make students very thirsty, so they u 阅读全文

posted @ 2013-11-15 14:49 keep trying 阅读(324) 评论(0) 推荐(0) 编辑

Electrification Plan MST

摘要: Electrification PlanTime Limit:500MSMemory Limit:65536KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeURAL 1982DescriptionSome country hasncities. The government has decided to electrify all these cities. At first, power stations inkdifferent cities were built. The other cities should be conn 阅读全文

posted @ 2013-11-15 14:48 keep trying 阅读(213) 评论(0) 推荐(0) 编辑

Parallel and Perpendicular 几何,数学

摘要: Parallel and PerpendicularTime Limit:500MSMemory Limit:65536KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeURAL 1981DescriptionYou are given a regularn-gon. Your task is to calculate two values: the number of its diagonals that are parallel to at least one of its other diagonals, and the num 阅读全文

posted @ 2013-11-15 14:47 keep trying 阅读(235) 评论(0) 推荐(0) 编辑

2013年11月11日

A. Soroban 暴力+水题

摘要: A. Sorobantime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou know that Japan is the country with almost the largest 'electronic devices per person' ratio. So you might be quite surprised to find out that the primary school in Japan teache 阅读全文

posted @ 2013-11-11 21:23 keep trying 阅读(265) 评论(0) 推荐(0) 编辑

B. Fence 前缀和 水题

摘要: B. Fencetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThere is a fence in front of Polycarpus's home. The fence consists ofnplanks of the same width which go one after another from left to right. The height of thei-th plank ishimeters, disti 阅读全文

posted @ 2013-11-11 21:22 keep trying 阅读(353) 评论(0) 推荐(0) 编辑

C. Fixing Typos 贪心

摘要: C. Fixing Typostime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputMany modern text editors automatically check the spelling of the user's text. Some editors even suggest how to correct typos.In this problem your task to implement a small function 阅读全文

posted @ 2013-11-11 21:21 keep trying 阅读(296) 评论(0) 推荐(0) 编辑

导航