GKHack's Blog

题目链接：点击打开链接第一行给出n、d，接下来n行每行两个数，代表一个人的财富程度与友好值，让你从里面选人使得友好值之和最大且任意两人财富值差值小于d。当时wa了好多发，比赛快结束时一个陌生紫名发来他的代码2333 我爆int以及思路有问题首先按照钱数从小到大排序n个结构体，b数组存储排序后前x个人的友好总值(x >= 1 && x 数差小于d的友好值最大的人，用刚刚的b数

DescriptionInhabitants of the Wonderland have decided to hold a regional programming contest. The Judging Committee has volunteered and has promised to organize the most honest contest ever. It wa

DescriptionFarmer John has built a new long barn, with N (2 His C (2 <= C <= N) cows don't like this barn layout and become aggressive towards each other once put into a stall. To prevent the

E. Read Timetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputMad scientist Mike does not use slow hard disks

Problem Description假设：S1 = 1S2 = 12S3 = 123S4 = 1234.........S9 = 123456789S10 = 1234567891S11 = 12345678912............S18 = 123456789123456789..................现在我们把所有的串连

1204: RectanglesTime Limit: 1 Sec  Memory Limit: 128 MBSubmit: 770  Solved: 112[Submit][Status][Web Board]Description如果限定矩形的边长必须为整数，且周长为定值L，那么面积在[A, B]范围内不同的矩形一共有多少个呢？在这个问题中，当且仅当两个矩形

ZYB's PremutationTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 638    Accepted Submission(s): 302Problem DescriptionZYB has