操作序列(网易)
摘要:小易有一个长度为n的整数序列,a_1,...,a_n。然后考虑在一个空序列b上进行n次以下操作:1、将a_i放入b序列的末尾2、逆置b序列小易需要你计算输出操作n次之后的b序列。 恩deque瞎搞
阅读全文
posted @
2017-08-23 20:18
Beserious
阅读(271)
推荐(0) 编辑
2018今日头条笔试(第二题)
摘要:题目描述 给定一个数组序列,需要选出一个区间,使得该区间是所有区间中经过如下计算的值最大的一个。 区间中的最小数 * 区间所有数的和 最后程序输出经过计算后的最大值即可,不需要输出具体的区间。如给定序列[6,2,1]可得到左右可以选定各个区间的计算值: [6]=6*6=36 [2]=2*2=4; [
阅读全文
posted @
2017-08-23 12:04
Beserious
阅读(937)
推荐(0) 编辑
leetcode 575. Distribute Candies
摘要:Given an integer array with even length, where different numbers in this array represent different kinds of candies. Each number means one candy of th
阅读全文
posted @
2017-07-28 09:32
Beserious
阅读(219)
推荐(0) 编辑
Codeforces Round #311 (Div. 2)C. Arthur and Table
摘要:C. Arthur and Table time limit per test 1 second time limit per test memory limit per test 256 megabytes memory limit per test input standard input in
阅读全文
posted @
2016-08-15 10:49
Beserious
阅读(286)
推荐(0) 编辑
Codeforces Round #364 (Div. 2) C. They Are Everywhere
摘要:C. They Are Everywhere time limit per test 2 seconds time limit per test memory limit per test 256 megabytes memory limit per test input standard inpu
阅读全文
posted @
2016-08-08 15:37
Beserious
阅读(221)
推荐(0) 编辑
HDU5806 NanoApe Loves Sequence Ⅱ
摘要:NanoApe Loves Sequence Ⅱ Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 262144/131072 K (Java/Others)Total Submission(s): 517 Accepted Submissio
阅读全文
posted @
2016-08-07 11:14
Beserious
阅读(199)
推荐(0) 编辑
HDU 5805 NanoApe Loves Sequence
摘要:NanoApe Loves Sequence Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/131072 K (Java/Others)Total Submission(s): 421 Accepted Submission(
阅读全文
posted @
2016-08-07 09:57
Beserious
阅读(367)
推荐(0) 编辑
HDU2072单词数
摘要:#include #include #include using namespace std; int main() { string s,line; while(getline(cin,line)&&line[0]!='#') { stringstream ss(line); set dict; while(ss>>s...
阅读全文
posted @
2016-08-01 12:15
Beserious
阅读(119)
推荐(0) 编辑
HDU 5752Sqrt Bo
摘要:Sqrt Bo Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 145 Accepted Submission(s): 72 Problem
阅读全文
posted @
2016-07-26 19:03
Beserious
阅读(135)
推荐(0) 编辑
Fibonacci数的后9位
摘要:import java.math.*; import java.util.*; public class Main{ /** * @param args */ public static void main(String[] args) { Scanner cin=new Scanner(System.in...
阅读全文
posted @
2016-07-15 20:52
Beserious
阅读(152)
推荐(0) 编辑
Tju 4119. HDFS
摘要:In HDFS( Hadoop Distributed File System), each data may have a lot of copies in case of data lose.This problem, every data has its own id, from 1 to n
阅读全文
posted @
2016-06-25 23:39
Beserious
阅读(327)
推荐(0) 编辑