12 2017 档案
摘要:摘自 https://www.cnblogs.com/Duahanlang/archive/2013/05/11/3073434.html
阅读全文
摘要:题目描述 给定两个长度为n的整数列A和B,每次你可以从A数列的左端或右端取走一个数。假设第i次取走的数为ax,则第i次取走的数的价值vi=bi⋅ax,现在希望你求出∑vi的最大值。 输入描述: 第一行一个数T,表示有T组数据。对于每组数据,第一行一个整数n,接下来两行分别给出A数列与B数列。 输出描
阅读全文
摘要:Thor is getting used to the Earth. As a gift Loki gave him a smartphone. There are n applications on this phone. Thor is fascinated by this phone. He
阅读全文
摘要:You've decided to carry out a survey in the theory of prime numbers. Let us remind you that a prime number is a positive integer that has exactly two
阅读全文
摘要:You are a "Problem Killer", you want to solve many problems. Now you have nn problems, the ii-th problem's difficulty is represented by an integer aia
阅读全文
摘要:刚刚开始学习汇编,结合网上的资料,写一下自己的理解
阅读全文
摘要:下面是3+5的汇编程序的代码和解释,记录一下,方便自己回顾: 另外,附一下关于 INT 21H的讲解: http://blog.csdn.net/bill_ming/article/details/7305269
阅读全文
摘要:题目描述 给出一个序列,你的任务是求序列中 (a[j]-a[i])/(j-i)【1<=i<j<=n】的最大值 输入描述: 本题包含多组输入,每组输入第一行一个数字n,表示序列的长度。然后接下来一行输入n个数,表示原先序列的样子。数据范围:3<=n<=200000-1000000000<=a[i]<=
阅读全文
摘要:Wang Xifeng's Little Plot Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1301 Accepted Submissio
阅读全文
摘要:C. Short Program time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Petya learned a new pro
阅读全文
摘要:B. Ralph And His Magic Field time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Ralph has a
阅读全文
摘要:The ant Welly now dedicates himself to urban infrastructure. He came to the kingdom of numbers and solicited an audience with the king. He recounted h
阅读全文
摘要:Consider a un-rooted tree T which is not the biological significance of tree or plant, but a tree as an undirected graph in graph theory with n nodes,
阅读全文

浙公网安备 33010602011771号