妍恐龙的博客....^~^眼熟我

水题Time Limit: 500 MSMemory Limit: 32768 KTotal Submit: 248(82 users)Total Accepted: 106(64 users)Rating: Special Judge: NoDescription因为是有关于接水的

Lowest Unique PriceTime Limit: 1000MS Memory Limit: 65536KB Submit Statistic Discuss Problem DescriptionRecently my buddies and I came across an idea! We want to build a website to sell things in a new

代码：#include<cstdio>#include<iostream>#include<cmath>#include<algorithm>#define ll long longusing namespace std;const int N=50010;int n,m;int col[N],f[N],pos[N];ll gcd(ll x,ll y){ return y

D. Fedor and couponstime limit per test:4 secondsmemory limit per test:256 megabytesinput:standard inputoutput:standard outputAll our characters have hobbies. The same is true for Fedor. He enjoys shop

C. Soldier and Cardstime limit per test:2 secondsmemory limit per test:256 megabytesinput:standard inputoutput:standard outputTwo bored soldiers are playing card war. Their card deck consists of exactl

C. Votingtime limit per test:1 secondmemory limit per test:256 megabytesinput:standard inputoutput:standard outputThere are n employees in Alternative Cake Manufacturing (ACM). They are now voting on s

1416: 等差数列Ⅱ Time Limit: 1 Sec Memory Limit: 32 MB Submit: 98 Solved: 9 [Submit][Status][Web Board] Description zjw最近回忆起了等差数列，等差数列满足相邻两项的差值为定值，这个定值叫做公差d，所以f(n) – f(n-1) = d (n>1)。zjw得到一个序列，但是zjw只

。 D. Kostya the Sculptortime limit per test:3 secondsmemory limit per test:256 megabytesinput:standard inputoutput:standard outputKostya is a genial sculptor, he has an idea: to carve a marble sculptu

Sliding WindowTime Limit: 12000MS Memory Limit: 65536K Total Submissions: 55878 Accepted: 16068 Case Time Limit: 5000MS DescriptionAn array of size n ≤ 106 is given to you. There is a sliding win

1012: [JSOI2008]最大数maxnumber Time Limit: 3 Sec Memory Limit: 162 MB Submit: 8597 Solved: 3768 Description　　现在请求你维护一个数列，要求提供以下两种操作：1、 查询操作。语法：Q L 功能：查询当前数列中末尾L 个数中的最大的数，并输出这个数的值。限制：L不超过当前数列的长度。2、

近代化改修 Time Limit: 3000 MS Memory Limit: 32768 K Total Submit: 162(47 users) Total Accepted: 33(32 users) Rating: Special Judge: No Description 舰娘们的战斗力可以用一个数值来表示，又分成了面板战斗力和实际战斗力。他们的换 算关系是：如果一个舰娘的面板

Fxx and gameAccepts: 74 Submissions: 1857 Time Limit: 3000/1500 MS (Java/Others)Memory Limit: 131072/65536 K (Java/Others)问题描述 青年理论计算机科学家Fxx给的学生设计了一款数字游戏。一开始你将会得到一个数X，每次游戏将给定两个参数k,t, 任意时刻你可以对你的数执行下面

题目链接：可交题的传送门   记得刚入门的时候问过学长可不可以自己定义一个优先队列，不过学长没搭理我。。。代码：#include using namespace std;struct node//注意优先队列里的比较函数，跟正常的正好相反。{ int Qnum,Period,Time; bool operator < (const node &t)const{ r

Dogs' CandiesTime Limit: 30000/30000 MS (Java/Others)    Memory Limit: 512000/512000 K (Java/Others)Total Submission(s): 1478    Accepted Submission(s): 351Problem DescriptionFar far

Leyni，罗莉和XianGeTime Limit: 1000 MSMemory Limit: 65536 KTotal Submit: 128(23 users)Total Accepted: 31(19 users)Rating: Special Judge: NoDes

Heap PartitionTime Limit: 2 Seconds Memory Limit: 65536 KB Special Judge A sequence S = {s1, s2, …, sn} is called heapable if there exists a binary tree T with n nodes such that every node