[CF1131C]Birthday【贪心】

【[CF1131C]Birthday【贪心】】的更多相关文章

[CF1131C]Birthday【贪心】

题目描述有 n n个数摆放在一个环形中(最后一个与第一个相邻),需要改变这些数的顺序,使得相邻两个数的最大绝对差最小.如果有多种最佳方案,输出任意一种. (翻译来自洛谷) 分析首先收尾相接,那么很容易想到是用贪心. 从小到大排序后,我们考虑如何贪心. 因为我们需要绝对值最小,那么坑定是一个是升序一个降序. 什么意思?就是两个跳从头调到尾,在跳回来. 要注意判断奇偶性. 代码 #include <bits/stdc++.h> using namespace std; int n; int a…

BZOJ 1692: [Usaco2007 Dec]队列变换 [后缀数组贪心]

1692: [Usaco2007 Dec]队列变换 Time Limit: 5 Sec Memory Limit: 64 MBSubmit: 1383 Solved: 582[Submit][Status][Discuss] Description FJ打算带他的N(1 <= N <= 30,000)头奶牛去参加一年一度的“全美农场主大奖赛”.在这场比赛中,每个参赛者都必须让他的奶牛排成一列,然后领她们从裁判席前依次走过. 今年,竞赛委员会在接受队伍报名时,采用了一种新的登记规则:他们把所…

HDOJ 1051. Wooden Sticks 贪心结构体排序

Wooden Sticks Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 15564 Accepted Submission(s): 6405 Problem Description There is a pile of n wooden sticks. The length and weight of each stick a…

HDOJ 1009. Fat Mouse' Trade 贪心结构体排序

FatMouse' Trade Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 56784 Accepted Submission(s): 19009 Problem Description FatMouse prepared M pounds of cat food, ready to trade with the cats g…

BZOJ 1691: [Usaco2007 Dec]挑剔的美食家 [treap 贪心]

1691: [Usaco2007 Dec]挑剔的美食家 Time Limit: 5 Sec Memory Limit: 64 MBSubmit: 786 Solved: 391[Submit][Status][Discuss] Description 与很多奶牛一样,Farmer John那群养尊处优的奶牛们对食物越来越挑剔,随便拿堆草就能打发她们午饭的日子自然是一去不返了.现在,Farmer John不得不去牧草专供商那里购买大量美味多汁的牧草,来满足他那N(1 <= N <= 100,…

【Codeforces 738D】Sea Battle（贪心）

http://codeforces.com/contest/738/problem/D Galya is playing one-dimensional Sea Battle on a 1 × n grid. In this game a ships are placed on the grid. Each of the ships consists of bconsecutive cells. No cell can be part of two ships, however, the shi…