2015年08月__Wilbert

原创 AOJ-542-Window/POJ-2823-Window

Description An array of size n ≤ 106 is given to you. There is a sliding window of size k which is moving from the very left of the array to the very right. You can only see the k numbers in the wi

2015-08-26 11:57:20 491

原创 HDU-1074-Doing Homework

Problem Description Ignatius has just come back school from the 30th ACM/ICPC. Now he has a lot of homework to do. Every teacher gives him a deadline of handing in the homework. If Ignatius hands in

2015-08-23 20:06:06 452

Problem Description AFA is a girl who like runing.Today,he download an app about runing .The app can record the trace of her runing.AFA will start runing in the park.There are many chairs in the park,

2015-08-22 18:19:38 503

原创 HDU-5366-The mook jong

Problem DescriptionZJiaQ want to become a strong man, so he decided to play the mook jong。ZJiaQ want to put some mook jongs in his backyard. His backyard consist of n bricks that is 1*1,so it is 1*n。ZJ

2015-08-22 18:14:26 571

原创 HDU-5391-Zball in Tina Town

Problem Description Tina Town is a friendly place. People there care about each other. Tina has a ball called zball. Zball is magic. It grows larger every day. On the first day, it becomes 1 time

2015-08-22 17:36:07 645

原创 AOJ-351-求最值之差

Description 给出N个数，求第a个数到第b个数之间最大的数减去最小的数的结果Input N（N小于100,000），M（M小于100,000）接下来有N个数接下来M组范围,所有数均在[0,231-1]内每个范围有2个整数a,b(1<=a<=b<=N) Output 每行输出一个结果Sample Input 5 3 4 2 5 1 10 1 5 2 3 2 2Sa

2015-08-21 23:26:47 575

原创 AOJ-743-多重部分和问题

Description 有n种不同大小的数字，每种各个。判断是否可以从这些数字之中选出若干使它们的和恰好为K。Input 首先是一个正整数T(1<=T<=100) 接下来是T组数据每组数据第一行是一个正整数n(1<=n<=100)，表示有n种不同大小的数字第二行是n个不同大小的正整数ai(1<=ai<=100000) 第三行是n个正整数mi(1<=mi<=100000)，表示每种数字

2015-08-21 23:16:37 736

Wilbert的博客