Median
来源:互联网 发布:mac版草图大师专业版 编辑:程序博客网 时间:2024/03/29 09:37
题目描述: 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 145 9 10 15 16 17样例输出:13
题意:输入两串数列,将两列数据合并排序后求其中位数
代码:
#include<stdio.h>#define max 1000000long arry[max];int main(){<span style="white-space:pre"></span><span style="white-space:pre"></span>int N, M;<span style="white-space:pre"></span>scanf("%d" , &N);<span style="white-space:pre"></span>for (int i = 0; i < N; i++)<span style="white-space:pre"></span>{<span style="white-space:pre"></span>scanf("%ld" , &arry[i]);<span style="white-space:pre"></span>}<span style="white-space:pre"></span>scanf("%d", &M);<span style="white-space:pre"></span>for (int j = N; j < N+M; j++)<span style="white-space:pre"></span>{<span style="white-space:pre"></span>scanf("%ld", &arry[j]);<span style="white-space:pre"></span>}<span style="white-space:pre"></span>for (int i = 0; i < N + M; i++)<span style="white-space:pre"></span>{<span style="white-space:pre"></span>for (int j = i + 1; j < N + M; j++)<span style="white-space:pre"></span>{<span style="white-space:pre"></span>if (arry[i] > arry[j])<span style="white-space:pre"></span>{<span style="white-space:pre"></span>arry[i] = arry[i] ^ arry[j];<span style="white-space:pre"></span>arry[j] = arry[i] ^ arry[j];<span style="white-space:pre"></span>arry[i] = arry[i] ^ arry[j];<span style="white-space:pre"></span>}<span style="white-space:pre"></span>}<span style="white-space:pre"></span>}<span style="white-space:pre"></span><span style="white-space:pre"></span>if ((M + N) % 2 != 0)<span style="white-space:pre"></span>{<span style="white-space:pre"></span>printf("%ld\n" , arry[(M + N)/2]);<span style="white-space:pre"></span>}<span style="white-space:pre"></span>else<span style="white-space:pre"></span>{<span style="white-space:pre"></span>printf("%ld\n", (arry[(M + N) / 2]+arry[(M + N + 2) / 2]) / 2);<span style="white-space:pre"></span>}<span style="white-space:pre"></span><span style="white-space:pre"></span>getchar();<span style="white-space:pre"></span>getchar();<span style="white-space:pre"></span>return 0;}
0 0
- Median
- Median
- Median
- median
- Median
- Median
- Median
- median
- median
- Median
- Median Filter
- M Median
- Find Median
- ZOJ3612 Median
- Median Filter
- zju2011 Median
- 1029. Median
- PAT_1029: Median
- java第二天
- 0. Spring4.1-环境搭建
- 机器视觉入门知识总结
- Python开发环境搭建
- nginx日志配置
- Median
- hdu2126
- android利用回调函数在对话框中传递数据
- Android开发如何实现和服务器的数据同步
- iOS的property相关修饰符
- service开个线程下载文件,并更新notification中的progressbar
- Node.js开发指南学习记录1
- Java中的冒泡排序原理及实现方法
- hbase 学习梳理