sicily 1046 Plane Spotting
来源:互联网 发布:c语言经典程序100道 编辑:程序博客网 时间:2024/05/17 02:43
1046. Plane Spotting
Constraints
Time Limit: 1 secs, Memory Limit: 32 MB
Description
Craig is fond of planes. Making photographs of planes forms a major part of his daily life. Since he tries to stimulate his social life, and since it’s quite a drive from his home to the airport, Craig tries to be very efficient by investigating what the optimal times are for his plane spotting. Together with some friends he has collected statistics of the number of passing planes in consecutive periods of fifteen minutes (which for obvious reasons we shall call ‘quarters’). In order to plan his trips as efficiently as possible, he is interested in the average number of planes over a certain time period. This way he will get the best return for the time invested. Furthermore, in order to plan his trips with his other activities, he wants to have a list of possible time periods to choose from. These time periods must be ordered such that the most preferable time period is at the top, followed by the next preferable time period, etc. etc. The following rules define which is the order between time periods:
1. A period has to consist of at least a certain number of quarters, since Craig will not drive three hours to be there for just one measly quarter.
2. A period P1 is better than another period P2 if:
* the number of planes per quarter in P1 is higher than in P2;
* the numbers are equal but P1 is a longer period (more quarters);
* the numbers are equal and they are equally long, but period P1 ends earlier.
Now Craig is not a clever programmer, so he needs someone who will write the good stuff: that means you. So, given input consisting of the number of planes per quarter and the requested number of periods, you will calculate the requested list of optimal periods. If not enough time periods exist which meet requirement 1, you should give only the allowed time periods.
Input
The input starts with a line containing the number of runs N. Next follows two lines for each run. The first line contains three numbers: the number of quarters (1–300), the number of requested best periods (1–100) and the minimum number of quarters Craig wants to spend spotting planes (1–300). The sec-nod line contains one number per quarter, describing for each quarter the observed number of planes. The airport can handle a maximum of 200 planes per quarter.
Output
The output contains the following results for every run:
* A line containing the text “Result for run <N>:” where <N> is the index of the run.
* One line for every requested period: “<F>-<L>” where <F> is first quarter and <L> is the last quarter of the period. The numbering of quarters starts at 1. The output must be ordered such that the most preferable period is at the top.
Sample Input
310 5 51 5 0 2 1 4 2 5 0 2 10 3 510 3 1 4 2 6 3 0 8 0 5 5 51 2 3 4 5
Sample Output
Result for run 1:4-82-86-101-82-6Result for run 2:1-61-71-9Result for run 3:1-5
// Problem#: 1046// Submission#: 2993377// The source code is licensed under Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported License// URI: http://creativecommons.org/licenses/by-nc-sa/3.0/// All Copyright reserved by Informatic Lab of Sun Yat-sen University#include <iostream>#include <map>#include <string>#include <list>#include <algorithm>#include <cmath>using namespace std;struct period { double aver; int length, ends;};period p[100000];int array[310] = { 0 };bool cmp (const period& a, const period& b){ if (fabs(a.aver - b.aver) > 0.000000001) return a.aver > b.aver; if (a.length != b.length) return a.length > b.length; return a.ends < b.ends;}int main(){ int T, i, k, temp; cin >> T; for (int j = 1; j <= T; j++) { int n, l, t, cnt = 0; cin >> n >> l >> t; array[310] = { 0 }; for (i = 1; i <= n; i++) { cin >> array[i]; } for (i = 1; i <= n; i++) { temp = 0; for (k = i; k <= n; k++) { temp += array[k]; if ((k - i + 1) >= t) { p[cnt].aver = (double)temp / (k - i + 1); p[cnt].length = (k - i + 1); p[cnt].ends = k; cnt++; } } } sort(p, p + cnt, cmp); cout << "Result for run " << j << ":" << endl; if (cnt > l) { for (i = 0; i < l; i++) { cout << p[i].ends - p[i].length + 1 << "-" << p[i].ends << endl; } } else { for (i = 0; i < cnt; i++) { cout << p[i].ends - p[i].length + 1 << "-" << p[i].ends << endl; } } } return 0;}
bool
cmp(
const
period&a,
const
period&b)和
bool
operator< (
const
period&a,
const
period&b)是一样的
- sicily 1046 Plane Spotting
- sicily 1046 Plane Spotting
- Sicily 1046, Plane Spotting
- sicily 1046 Plane Spotting
- sicily--1046. Plane Spotting
- Sicily 1046. Plane Spotting
- sicily 1046. Plane Spotting
- sicily 1046.Plane Spotting
- [sicily]1046. Plane Spotting
- Sicily 1046. Plane Spotting
- sicily 1046. Plane Spotting
- sicily 1046. Plane Spotting
- Sicily 1046. Plane Spotting
- [sicily online]1046. Plane Spotting
- Sicily.1046. Plane Spotting(排序)
- 1046 Plane Spotting
- Plane Spotting
- 1046. Plane Spotting
- 外部样式表中Background-Image:url()的设置不能显示解决方案
- c++是这样调用dll的
- sicily 1020 Big Integer
- sicily 1027 MJ, Nowhere to Hide
- Sicily 1035 DNA matching
- sicily 1046 Plane Spotting
- sicily 1198 Substring
- 如何掌握程序语言(转自王垠Blog)
- sicily 1009 梅森素数
- sicily 1443 Printer Queue
- sicily 1156.Binary tree
- Android 文字自动滚动(跑马灯)效果的两种实现方法
- Log4j.properties配置详解
- 用TreeSet存储一个Student对象