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

E -单点修改Crawling in process...Crawling failedTime Limit:1000MS    Memory Limit:32768KB     64bit IO Format:%I64d & %I64uSubmitStatus DescriptionInputOutput

D. Legacy time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output Rick and his co-workers have made a new radioactive formula and a lot of bad guy

1036: [ZJOI2008]树的统计CountTime Limit: 10 Sec Memory Limit: 162 MB Submit: 16631 Solved: 6756 [Submit][Status][Discuss] Description　　一棵树上有n个节点，编号分别为1到n，每个节点都有一个权值w。我们将以下面的形式来要求你对这棵树完成 一些操作： I. CHAN

C. Fountains time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output Arkady plays Gardenscapes a lot. Arkady wants to build two new fountains. The

Minimum Inversion NumberTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 17930    Accepted Submission(s): 10891Problem Descriptio

Apple Tree Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 28674 Accepted: 8513 DescriptionThere is an apple tree outside of kaka’s house. Every autumn, a lot of apples will g

坏坏い月是月大叔的ID，他是一个掌握者772002种魔法的物理系战士，最擅长的技能就是搞事。今天他又要开始搞事了。给你 n n个数，你需要实现一下操作：l r v ,在[l,r]区间内找到第一个大于等于v的数,输出这个数的下标,如果找不到的话，请输出-1噢l r v，让[l,r]区间所有数增加vINPUT 输入第一行包含一个正整数 t ( 1 ≤ t ≤ 100 ) t(1≤

皮卡丘的梦想2 Time Limit: 1000MS Memory Limit: 65536KB Submit Statistic Problem Description一天，一只住在 501 实验室的皮卡丘决定发奋学习，成为像 LeiQ 一样的巨巨，于是他向镇上的贤者金桔请教如何才能进化成一只雷丘。 金桔告诉他需要进化石才能进化，并给了他一个地图，地图上有 n 个小镇，他需要从这些小镇中收

问题 E: 简单的RMQ 时间限制: 2 Sec 内存限制: 64 MB 提交: 914 解决: 158 [提交][状态][讨论版] 题目描述 给定一个数组，其中的元素满足非递减顺序。任意给定一个区间[i,j]，求其中某个元素重复出现的最大次数。输入 多组数据输入。每组数据的第一行包含两个整数n和q(1<=n,q<=100000)，下一行包含n个整数a1,…,an(-100000<=

题意：给出n个房间m个人，每个人需要打扫[l,r]的房间。问有几个队可以偷懒不用干活 代码：#include<stdio.h>#include<stdlib.h>#include<algorithm>#include<iostream>#include<vector>#include<map>#include<math.h>#include<string.h>#define ll

E. Hanoi Factorytime limit per test:1 secondmemory limit per test:256 megabytesinput:standard inputoutput:standard outputOf course you have heard the famous task about Hanoi Towers, but did you know th

DescriptionYou have N integers, A1,A2, ... , AN. You need to deal with two kinds of operations. One type of operation is to add some given number to each number in a given interval. The other

Description老师交给小可可一个维护数列的任务，现在小可可希望你来帮他完成。 有长为N的数列，不妨设为a1,a2,…,aN 。有如下三种操作形式： (1)把数列中的一段数全部乘一个值; (2)把数列中的一段数全部加一个值; (3)询问数列中的一段数的和，由于答案可能很大，你只需输出这个数模P的值。Input第一行两个整数N和P(1≤P≤1000000000）

题面下不出来 如果有想做的VJ查“UVA 11402 ”吧。给出题意：对一个01区间进行4种操作。1：区间值都置为1.    2：区间值都置为0.   3：区间值01呼唤。4求出区间和。题解：第一个操作可以等效成区间值*0+1.第二个操作可以等效成区间值*0.第三个操作可以等效成区间值（+1）&1。第四个操作就是线段树基本操作。此时这题转化成了上次blog写的内题类型。

FunctionTime Limit: 7000/3500 MS (Java/Others)    Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 1412    Accepted Submission(s): 521Problem DescriptionThe shorter,

BillboardTime Limit: 20000/8000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 19302    Accepted Submission(s): 8081Problem DescriptionAt the entra

Mod Time Limit: 1000 MS Memory Limit: 100000 K Total Submit: 28(5 users) Total Accepted: 8(4 users) Rating: Special Judge: No Description Kim刚刚学会C语言中的取模运算（mod）。他想要研究一下一个数字A模上一系列数后的结果是多少。帮他写个程序验证一下。 In

ZYB’s Premutation Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 1021 Accepted Submission(s): 522Problem DescriptionZYB has a premutatio

D. PolandBall and Polygontime limit per test:4 secondsmemory limit per test:256 megabytesinput:standard inputoutput:standard outputPolandBall has such a convex polygon with n veritces that no three of

Doom Time Limit: 12000/6000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others) Total Submission(s): 1547 Accepted Submission(s): 426 Problem Description THE END IS COMINGGGGGG! Mik