1057. Stack (30)--看

不使用树状数组的话，可以如下来解题。每次记录好中位数，在插入删除的时候调整中位数（前或者后移动一次即可）

#define  _CRT_SECURE_NO_WARNINGS 

#include<string>
#include<string.h>
#include<vector>
#include<map>
#include<stack>
#include<iostream>
#include<sstream>
#include<algorithm>
#include<stdio.h> 
using namespace std;  
int num[100001] = {0};
int main()
{ 
int N;
cin >> N;
int median = 0, before = 0;
vector<int> stac; 
for (int i = 0; i < N; i++)
{
char commond[11];
scanf("%s", commond);
if (strcmp(commond, "Pop") == 0)
{
if (stac.size() == 0)
printf("Invalid\n");
else
{
int inum = stac[stac.size() - 1]; 
if (inum < median)
before--;
num[inum]--;
printf("%d\n", inum);
stac.erase(stac.end() - 1);
if (stac.size() == 1)
{
before = 0;
median = stac[0];
continue;
}
if (before > (stac.size() - 1) / 2)
{
for (int j = median - 1; j >= 0; j--)
{
if (num[j])
{
median = j;
before -= num[j];
break;
}
}
}
if (before + num[median] < (stac.size() + 1) / 2)
{
before += num[median];
for (int j = median + 1; j <= 100000; j++)
{
if (num[j])
{
median = j;
break;
}
}
}
}
}
else if (strcmp(commond, "PeekMedian") == 0)
{
if (stac.size() == 0)
printf("Invalid\n");
else
{ 
printf("%d\n", median);
}
}
else
{
int itmp;
scanf("%d", &itmp);
stac.push_back(itmp);
num[itmp]++;
if (itmp < median)
before++;
if (stac.size() == 1)
{
before = 0;
median = stac[0];
continue;
}
if (before > (stac.size() - 1) / 2)
{
for (int j = median - 1; j >= 0; j--)
{
if (num[j])
{
median = j;
before -= num[j];
break;
}
}
}
if (before + num[median] < (stac.size() + 1) / 2)
{
before += num[median];
for (int j = median + 1; j <= 100000; j++)
{
if (num[j])
{
median = j; 
break;
}
}
}
}
}
return 0;

}

使用树状数组代码如下

#define  _CRT_SECURE_NO_WARNINGS 
#include<string>
#include<string.h>
#include<vector>
#include<map>
#include<stack>
#include<iostream>
#include<sstream>
#include<algorithm>
#include<stdio.h> 
using namespace std;  
int num[100001] = {0};
int lowbit(int num)
{
return (num&(-num));
}
void update(int inum,int i)
{
while (inum<100001)
{
num[inum] += i;
inum += lowbit(inum);
} 
}
int sum(int inum)
{
int sum = 0;
while (inum>0)
{
sum+=num[inum] ;
inum -= lowbit(inum);
}
return sum;
}
int find(int peekmedian,int low,int high)
{

while (low<high)
{
int mid = (low + high) / 2;
if (sum(mid) < peekmedian)
{
low = mid + 1;
} 
else
{
high = mid ;
}
}
return low;
}
int main()
{ 
stack<int> stack_num;
int N;
scanf("%d",&N);
for (int i = 0; i < N; i++)
{
char commond[11];
scanf("%s",commond);
if (commond[1] == 'o')//pop
{
if (stack_num.size() == 0)
{
printf("Invalid\n"); 
}
else
{
int itmp = stack_num.top();
update(itmp,-1);
stack_num.pop();
printf("%d\n", itmp);
}
}
else if (commond[1] == 'u')//push
{
int itmp;
scanf("%d",&itmp);
stack_num.push(itmp);
update(itmp,1);
}
else//PeekMedian
{
if (stack_num.size() == 0)
{
printf("Invalid\n");
}
else
{
int inum = find((stack_num.size()+1)/2,0,100000);
printf("%d\n",inum);
}
}
}
return 0;
}