Consider a system which is described at any time as being in one of a set of NN distinct states, 1,2,3,...,N1,2,3,...,N. We denote the time instants associated with state changes as t = 1,2,...t

题目1 : Visiting Peking University时间限制:1000ms单点时限:1000ms内存限制:256MB描述Ming is going to travel for n days and the date of these days can be represented by n integers: 0, 1, 2,

题目3 : Matrix时间限制:1000ms单点时限:1000ms内存限制:256MB描述Once upon a time, there was a little dog YK. One day, he went to an antique shop and was impressed by a beautiful picture. Y

题目4 : Agent Communication时间限制:1000ms单点时限:1000ms内存限制:256MB描述In Peking University, there are many homeless cats. The students of cat club built n nests and some paths for t

题目5 : Territorial Dispute时间限制:1000ms单点时限:1000ms内存限制:256MB描述In 2333, the C++ Empire and the Java Republic become the most powerful country in the world. They compete with

题目6 : Cake时间限制:1000ms单点时限:1000ms内存限制:256MB描述To celebrate that WF-2018 will be held in PKU, Alice, Bob, and Cate are asked to makeN cakes.Every cake i needs to go thro

题目7 : Bounce时间限制:1000ms单点时限:1000ms内存限制:256MB描述For Argo, it is very interesting watching a circle bouncing in a rectangle.As shown in the figure below, the rectangle is

Problem Description Here you have a set of strings. A dominator is a string of the set dominating all strings else. The string S is dominated by T if S is a substring of T.Input The input co

Problem Description A cubic number is the result of using a whole number in a multiplication three times. For example, 3×3×3=27 so 27 is a cubic number. The first few cubic numbers are 1,8,27,6

Problem Description Apple is Taotao’s favourite fruit. In his backyard, there are three apple trees with coordinates (x1,y1), (x2,y2), and (x3,y3). Now Taotao is planning to plant a new one, bu

A-时间统计 （很简单，直接算也成）时间限制：C/C++ 1秒，其他语言2秒空间限制：C/C++ 32768K，其他语言65536K64bit IO Format: %lld题目描述 某个实验需要统计时间，记录了实验开始和结束的时间，计算实验用了多少秒。 输入描述:第一行输入一个整数n，表示样例个数。接下来每组样例两行，表示开始时间和结束时间，格式为xdayHH:MM:SS，x是一个整数表示第几天...

传送门： D.Fence BuildingFarmer John owns a farm. He first builds a circle fence. Then, he will choose n points and build some straight fences connecting them. Next, he will feed a cow in each region ...

题目2 : Reverse Suffix Array时间限制:1000ms单点时限:1000ms内存限制:256MB描述There is a strong data structure called "Suffix Array" which can effectively solve string problems.Let S=s1s

The frequent subset problem is defined as follows. Suppose UU={1, 2,\ldots…,N} is the universe, and S_{1}S​1​​, S_{2}S​2​​,\ldots…,S_{M}S​M​​are MM sets over UU. Given a positive constant \alp

Let SS be a sequence of integers s_{1}s​1​​, s_{2}s​2​​, ......, s_{n}s​n​​ Each integer is is associated with a weight by the following rules:(1) If is is negative, then its weight is 00.(2)

You are given a list of train stations, say from the station 11 to the station 100100.The passengers can order several tickets from one station to another before the train leaves the station one.

Company ABC is holding an antique auction. In the auction, there are NN, 1 \leq N \leq 10001≤N≤1000, lots. We number the lots from 11 to NN. There are MM, 1 \leq M \leq 5001≤M≤500, bidders p

Consider the i-ji−j plane shown in Fig. 1Fig.1. The discrete-points, or nodes, of interest in this plane are indexed by ordered pairs of positive integers as those points in the first quadrant o

In computer graphics rendering it is required to do hidden surface removal, the first step in hidden surface removal is to determine the visible surfaces. In this problem you are asked to write a pr

Three circles C_{a}C​a​​, C_{b}C​b​​, and C_{c}C​c​​, all with radius RR and tangent to each other, are located in two-dimensional space as shown in Figure 11. A smaller circle C_{1}C​1​​ with

Cache memories have been used widely in current microprocessor systems. In this problem, you are asked to write a program for a cache simulator. The cache has the following metrics:1. The cache size

In the Personal Communication Service systems such as GSM (Global System for Mobile Communications), there are typically a number of base stations spreading around the service area. The base station

In this problem, we will define a graph called star graph, and the question is to find the minimum distance between two given nodes in the star graph.Given an integer nn, an n-dimensionaln−dimensi

Problem Description The Chinese Zodiac, known as Sheng Xiao, is based on a twelve-year cycle, each year in the cycle related to an animal sign. These signs are the rat, ox, tiger, rabbit, drago

A rectangular area specified in world coordinates is called a window. The rectangular area on the display device to which a window is mapped is called a viewport. The picture elements that fall with