wanghandou的博客

C. Animals Time Limit: 2000ms Memory Limit: 65536KB 64-bit integer IO format: %I64d      Java class name: (Any) Submit Status PID: 4769 Once upon a time DravDe, an outstanding

Chiaki has n intervals and the i-th of them is [li, ri]. She wants to delete some intervals so that there does not exist three intervals a, b and c such that a intersects with b, b intersects with

L2-003. 月饼 时间限制 100 ms 内存限制 65536 kB 代码长度限制 8000 B 判题程序 Standard 作者 陈越 月饼是中国人在中秋佳节时吃的一种传统食品，不同地区有许多不同风味的月饼。现给定所有种类月饼的库存量、总售价、以及市场的最大需求量，请你计算可以获得的最大收益是多少。

Danganronpa Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 0    Accepted Submission(s): 0 Problem Description Chisa Yukizome works as

简单的贪心 Hint Description The local toy store sells small fingerpainting kits with between three and twelve 50ml bottles of paint, each a different color. The paints are bright and fun

聪明的kk 时间限制：1000 ms  |  内存限制：65535 KB 难度：3 描述 聪明的“KK” 非洲某国展馆的设计灵感源于富有传奇色彩的沙漠中陡然起伏的沙丘，体现出本国不断变换和绚丽多彩的自然风光与城市风貌。展馆由五部分组成，馆内影院播放名为《一眨眼的瞬间》的宽银幕短片，反映了建国以来人民生活水平和城市居住环境的惊人巨变。 可移动“沙丘”变戏法 的灵感源于其独特而雄伟的

D - Moving Tables Crawling in process... Crawling failed Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u Submit Status Description The famous ACM (Advan

田忌赛马 时间限制：3000 ms  |  内存限制：65535 KB 难度：3 描述 Here is a famous story in Chinese history. "That was about 2300 years ago. General Tian Ji was a high official in the country Qi. He likes to play

Flying to the Mars Crawling in process... Crawling failed Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u Submit Status Description In the year 88

Wooden Sticks Crawling in process... Crawling failed Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u Submit Status Description There is a pile of n wood

J - Saving HDU Crawling in process... Crawling failed Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u Submit Status Description 话说上回讲到海东集团面临内外交困，公司的元老也只

O - Persistent Numbers Crawling in process... Crawling failed Time Limit:1000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u Submit Status Description The multiplicati

U - Radar Installation Crawling in process... Crawling failed Time Limit:1000MS     Memory Limit:10000KB     64bit IO Format:%I64d & %I64u Submit Status Description Assume the coast

T - Game Prediction Crawling in process... Crawling failed Time Limit:1000MS     Memory Limit:10000KB     64bit IO Format:%I64d & %I64u Submit Status Description Suppose there are M

sequence Time Limit: 1000MS Memory Limit: 65536KB Description 将一个给定的数列，拆分成K个不降序列，每个数出现且只出现一次，且在各序列中各个数相对于原数列的相对顺序不变。如7 6 9 8 10可以拆成 7 9 10和6 8。求最小的K值。 Input 第一行输入一个整数T（1 Output 对每组

Given the sequence AA with nn integers t1,t2,⋯,tnt1,t2,⋯,tn. Given the integral coefficients aa and bb. The fact that select two elements titi and tjtj of AA and i≠ji≠j to maximi