摘要：
DescriptionAn 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 r... 阅读全文
摘要：
Problem DescriptionIgnatius 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 o... 阅读全文
摘要：
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 s... 阅读全文
摘要：
Problem Description ZJiaQ want to become a strong man, so he decided to play the mook jong。ZJiaQ want to put some mook jongs in his backyard. ... 阅读全文
摘要：
Problem DescriptionTina Town is a friendly place. People there care about each other.Tina has a ball called zball. Zball is magic. It grows larger eve... 阅读全文
摘要：
Description 给出N个数，求第a个数到第b个数之间最大的数减去最小的数的结果Input N（N小于100,000），M（M小于100,000） 接下来有N个数 接下来M组范围,所有数均在[0,231-1]内 每个范围有2个整数a,b(1using namespace std... 阅读全文
摘要：
Description 有n种不同大小的数字，每种各个。判断是否可以从这些数字之中选出若干使它们的和恰好为K。Input 首先是一个正整数T(1#include #include #include #include using namespace std;const int maxn... 阅读全文
摘要：
题目描述 Description 某国为了防御敌国的导弹袭击，发展出一种导弹拦截系统。但是这种导弹拦截系统有一个缺陷：虽然它的第一发炮弹能够到达任意的高度，但是以后每一发炮弹都不能高于前一发的高度。某天，雷达捕捉到敌国的导弹来袭。由于该系统还在试用阶段，所以只有一套系统，因此... 阅读全文