LEOSATA's Blog

A1112 Stucked Keyboard (20) #include<cstdio> #include<algorithm> #include<vector> #include<cstring> using namespace std; const int maxk = 1300; const int maxn = 300; int K; char s1[maxk], s2[maxk]; //bool isPrint[maxn] = {false};

1017 Queueing at Bank (25point(s)) #include<cstdio> #include<algorithm> using namespace std; const int maxn = 10010; const int maxk = 110; int N, K; struct Node{ int hh,mm,ss; int time; int process; }customer[maxn]; bool cmp(Node a, Node

A1007 Maximum Subsequence Sum (25point(s)) #include<cstdio> #include<algorithm> using namespace std; const int maxn = 10010; int K; int dp[maxn], s[maxn], a[maxn]; int main(){ bool fla...

A1006 Sign In and Sign Out (25point(s)) #include<cstdio> #include<algorithm> using namespace std; const int maxm = 1000; int M; struct Node{ char ID[20]; int InTime; int OutTime; } n...

A1004 Counting Leaves (30point(s)) #include<cstdio> #include<algorithm> #include<vector> #include<queue> using namespace std; const int maxn = 101; int N, M; struct Node{ ve...

Given a hash table of size N, we can define a hash function H(x)=x%N. Suppose that the linear probing is used to solve collisions, we can easily obtain the status of the hash table with a given sequen...

This time let us consider the situation in the movie “Live and Let Die” in which James Bond, the world’s most famous spy, was captured by a group of drug dealers. He was sent to a small piece of land ...

Given the relations of all the activities of a project, you are supposed to find the earliest completion time of the project. Input Specification: Each input file contains one test case. Each case sta...

According to Wikipedia: Insertion sort iterates, consuming one input element each repetition, and growing a sorted output list. Each iteration, insertion sort removes one element from the input data, ...

A family hierarchy is usually presented by a pedigree tree. Your job is to count those family members who have no child. Input Specification: Each input file contains one test case. Each case starts w...

Given any permutation of the numbers {0, 1, 2,…, N−1}, it is easy to sort them in increasing order. But what if Swap(0, *) is the ONLY operation that is allowed to use? For example, to sort {4, 0, 2, ...

哈利·波特要考试了，他需要你的帮助。这门课学的是用魔咒将一种动物变成另一种动物的本事。例如将猫变成老鼠的魔咒是haha，将老鼠变成鱼的魔咒是hehe等等。反方向变化的魔咒就是简单地将原来的魔咒倒过来念，例如ahah可以将老鼠变成猫。另外，如果想把猫变成鱼，可以通过念一个直接魔咒lalala，也可以将猫变老鼠、老鼠变鱼的魔咒连起来念：hahahehe。 现在哈利·波特的手里有一本教材，里面列出了所有...

给定大量手机用户通话记录，找出其中通话次数最多的聊天狂人。 输入格式: 输入首先给出正整数N（≤10 ​5 ​​ ），为通话记录条数。随后N行，每行给出一条通话记录。简单起见，这里只列出拨出方和接收方的11位数字构成的手机号码，其中以空格分隔。 输出格式: 在一行中给出聊天狂人的手机号码及其通话次数，其间以空格分隔。如果这样的人不唯一，则输出狂人中最小的号码及其通话次数，并且附加给出并列狂人的人数...

According to Wikipedia: Insertion sort iterates, consuming one input element each repetition, and growing a sorted output list. Each iteration, insertion sort removes one element from the input data, ...

有了一张自驾旅游路线图，你会知道城市间的高速公路长度、以及该公路要收取的过路费。现在需要你写一个程序，帮助前来咨询的游客找一条出发地和目的地之间的最短路径。如果有若干条路径都是最短的，那么需要输出最便宜的一条路径。 输入格式: 输入说明：输入数据的第1行给出4个正整数N、M、S、D，其中N（2≤N≤500）是城市的个数，顺便假设城市的编号为0~(N−1)；M是高速公路的条数；S是出发地的城市编号；...