【九度OJ】1004:Median
来源:互联网 发布:以人为镜可以知得失 编辑:程序博客网 时间:2024/05/22 05:21
地址:
http://ac.jobdu.com/problem.php?pid=1004
题目描述:
Given an increasing sequence S of N integers, the median is the number at the middle position. For example, the median of S1={11, 12, 13, 14} is 12, and the median of S2={9, 10, 15, 16, 17} is 15. The median of two sequences is defined to be the median of the non-decreasing sequence which contains all the elements of both sequences. For example, the median of S1 and S2 is 13.
Given two increasing sequences of integers, you are asked to find their median.
输入:
Each input file may contain more than one test case.
Each case occupies 2 lines, each gives the information of a sequence. For each sequence, the first positive integer N (≤1000000) is the size of that sequence. Then N integers follow, separated by a space.
It is guaranteed that all the integers are in the range of long int.
输出:
For each test case you should output the median of the two given sequences in a line.
样例输入:
4 11 12 13 14
5 9 10 15 16 17
样例输出:
13
来源:
2011年浙江大学计算机及软件工程研究生机试真题
源码:
#include<stdio.h>int na, nb;int median;int strA[ 1000005 ];int strB[ 1000005 ];int strAB[ 1000005 ];int main(){ while( scanf( "%d", &na) != EOF ){ for( int i = 0; i < na; i ++ ){ scanf( "%d", &strA[ i ] ); } scanf( "%d", &nb); for( int i = 0; i < nb; i ++ ){ scanf( "%d", &strB[ i ] ); } int median = (na + nb)/2; for( int i = 0, x = 0, y = 0; i < median + 1; i ++ ){ if( x > na - 1 ){ strAB[ i ] = strB[ y ]; y++; continue; } if( y > nb - 1 ){ strAB[ i ] = strA[ x ]; x++; continue; } if( strA[ x ] > strB[ y ] ){ strAB[ i ] = strB[ y ]; y++; } else{ strAB[ i ] = strA[ x ]; x++; } } if( (na+nb) % 2 == 1 ){ //奇数 printf("%d\n", strAB[ median ] ); } else{ //偶数 printf("%d\n", strAB[ median - 1 ] ); } }}/************************************************************** Problem: 1004 User: 螺小旋 Language: C++ Result: Accepted Time:0 ms Memory:12740 kb****************************************************************/
- 九度 OJ 1004 median
- 九度OJ 1004:Median
- 九度oj-1004-Median
- 九度 OJ 1004:Median
- 九度OJ : 1004 Median
- 九度OJ-1004:Median
- 【九度OJ】1004:Median
- 九度OJ--题目1004:Median
- 九度OJ题目1004:Median
- 九度OJ 题目1004:Median
- 九度 1004 Median
- 九度[1004]-Median
- 【九度】题目1004:Median
- 九度:1004<Median><中位数>
- 九度 题目1004:Median
- 九度题目1004:Median
- 九度oj 题目1004:Median 【ZJU2011考研机试题3】
- 九度OJ 1004
- mybits,环境搭建和简单查询
- K-means算法
- 机器学习之监督学习-分类
- C++中*与&的使用和辨析
- keil使用问题总结
- 【九度OJ】1004:Median
- Shell简介
- Java中的锁分类
- warning C4267: “初始化” : 从“size_t”转换到“short”,可能丢失数据
- js 深拷贝与简拷贝
- VideoScribe(动画制作软件)下载 v2.0.1中文版
- Javascript实现HashTable(哈希表)
- python数据结构 栈的应用——符号匹配,进制转化,后缀。
- 拼多多-最大乘积-c/c++