hdu 5078(2014鞍山现场赛 I题)

【hdu 5078(2014鞍山现场赛 I题)】的更多相关文章

hdu 5078 2014鞍山现场赛水题

http://acm.hdu.edu.cn/showproblem.php?pid=5078 现场最水的一道题连排序都不用,由于说了ti<ti+1 //#pragma comment(linker, "/STACK:102400000,102400000") #include <cstdio> #include <cstring> #include <algorithm> #include <string> #include &l…

hdu 5078(2014鞍山现场赛 I题)

数据表示每次到达某个位置的坐标和时间计算出每对相邻点之间转移的速度(两点间距离距离/相隔时间) 输出最大值 Sample Input252 1 9//t x y3 7 25 9 06 6 37 6 01011 35 6723 2 2929 58 2230 67 6936 56 9362 42 1167 73 2968 19 2172 37 8482 24 98 Sample Output9.219544457354.5893762558 # include <iostream> # inc…

hdu 5071(2014鞍山现场赛B题，大模拟）

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=5071 思路:模拟题,没啥可说的,移动的时候需要注意top的变化. #include <iostream> #include <cstdio> #include <cstring> #include <algorithm> using namespace std; const int MAX_N = (5000 + 500); struct Girl { int…

2014鞍山现场赛C题HDU5072（素筛+容斥原理）

Coprime Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others) Total Submission(s): 130 Accepted Submission(s): 59 Problem Description There are n people standing in a line. Each of them has a unique id number. Now t…

hdu 5112 (2014北京现场赛 A题)

给出某个时刻对应的速度求出相邻时刻的平均速度输出最大值 Sample Input23 // n2 2 //t v1 13 430 31 52 0 Sample OutputCase #1: 2.00Case #2: 5.00 # include <iostream> # include <cstdio> # include <cstring> # include <algorithm> # include <string> # include…

hdu 5131 (2014广州现场赛 E题)

题意:对给出的好汉按杀敌数从大到小排序,若相等,按字典序排.M个询问,询问名字输出对应的主排名和次排名.(排序之后)主排名是在该名字前比他杀敌数多的人的个数加1,次排名是该名字前和他杀敌数相等的人的个数加1,(也就是杀敌数相等,但是字典序比他小的人数加1) Sample Input5WuSong 12LuZhishen 12SongJiang 13LuJunyi 1HuaRong 155 //mWuSongLuJunyiLuZhishenHuaRongSongJiang0 Sample Outp…