国产探花免费观看_亚洲丰满少妇自慰呻吟_97日韩有码在线_资源在线日韩欧美_一区二区精品毛片,辰东完美世界有声小说,欢乐颂第一季,yy玄幻小说排行榜完本

首頁 > 學院 > 開發設計 > 正文

PAT甲級1057

2019-11-10 19:53:12
字體:
來源:轉載
供稿:網友

1057. Stack (30)

時間限制150 ms內存限制65536 kB代碼長度限制16000 B判題程序Standard作者CHEN, Yue

Stack is one of the most fundamental data structures, which is based on the PRinciple of Last In First Out (LIFO). The basic Operations include Push (inserting an element onto the top position) and Pop (deleting the top element). Now you are supposed to implement a stack with an extra operation: PeekMedian -- return the median value of all the elements in the stack. With N elements, the median value is defined to be the (N/2)-th smallest element if N is even, or ((N+1)/2)-th if N is odd.

Input Specification:

Each input file contains one test case. For each case, the first line contains a positive integer N (<= 105). Then N lines follow, each contains a command in one of the following 3 formats:

Push keyPopPeekMedian

where key is a positive integer no more than 105.

Output Specification:

For each Push command, insert key into the stack and output nothing. For each Pop or PeekMedian command, print in a line the corresponding returned value. If the command is invalid, print "Invalid" instead.

Sample Input:
17PopPeekMedianPush 3PeekMedianPush 2PeekMedianPush 1PeekMedianPopPopPush 5Push 4PeekMedianPopPopPopPopSample Output:
InvalidInvalid322124453Invalid
#include<cstdio>#include<iostream>#include<vector>#include<string>#include<cstring>#include<algorithm>using namespace std;const int maxn = 100000 + 10;int Stack[maxn];int top =0;//下標1位置為棧底int N;char command[20];int blockrange = sqrt(maxn);int block[1000] = { 0 };int table[maxn] = { 0 };void push(int x){	Stack[++top] = x;}int popvalue;bool pop(){	if (top)	{		popvalue = Stack[top];		table[Stack[top]]--;		block[Stack[top] / blockrange]--;		top--;		return true;	}	return false;}int peekmedian(){	int k = (top % 2 == 0) ? top / 2 : (top + 1) / 2;	int sum = 0;//統計小于第k小的數之前的個數	int index;	for (int i = 0; i < blockrange; i++)	{		sum += block[i];//分塊法		if (sum >=k)		{			index = i;			sum -= block[i];			break;		}	}	int	start = (index)*blockrange;//這里注意塊號是從0開始的,并且注意每個塊的管轄范圍	for (int i = start; i < start + blockrange; i++)	{//這里注意記錄每個數出現的次數的table的下標是從1開始的		sum += table[i];		if (sum >= k)		{			return i;		}	}}int main(){	scanf("%d",&N); int temp;	for (int i = 0; i < N; i++)	{		scanf("%s", command);		if (strcmp(command,"Pop")==0)		{			if (!pop())			{				printf("Invalid/n");			}			else				printf("%d/n", popvalue);		}		else if (strcmp(command, "PeekMedian") == 0)		{			if (top>0)				printf("%d/n", peekmedian());			else				printf("Invalid/n");		}		else		{			scanf("%d", &temp);			table[temp]++;			block[temp / blockrange]++;			push(temp);		}	}	return 0;}/*分塊法:先劃分sqrt(maxn)(向上取整)個塊,然后用hash表統計每個輸入的數的個數并用塊表統計每個塊內數字出現的總個數,注意塊號從0開始,管轄范圍也是從k*blocksize開始,k=0,1,2,3...*/
發表評論 共有條評論
用戶名: 密碼:
驗證碼: 匿名發表
主站蜘蛛池模板: 鄄城县| 怀仁县| 武鸣县| 定安县| 乌审旗| 新绛县| 台州市| 洛阳市| 澎湖县| 夏邑县| 吉林省| 来凤县| 长子县| 宝丰县| 珠海市| 马关县| 怀来县| 临洮县| 东乡族自治县| 五指山市| 垦利县| 西乌珠穆沁旗| 九龙县| 乌兰浩特市| 远安县| 平泉县| 宜昌市| 阳高县| 永康市| 揭东县| 论坛| 沁阳市| 田东县| 临夏县| 崇信县| 保定市| 夹江县| 衢州市| 仁怀市| 商都县| 松阳县|