A1057. Stack

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 (<= 10⁵). Then N lines follow, each contains a command in one of the following 3 formats:

Push key
Pop
PeekMedian

where key is a positive integer no more than 10⁵.

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:

17
Pop
PeekMedian
Push 3
PeekMedian
Push 2
PeekMedian
Push 1
PeekMedian
Pop
Pop
Push 5
Push 4
PeekMedian
Pop
Pop
Pop
Pop

Sample Output:

Invalid
Invalid
3
2
2
1
2
4
4
5
3
Invalid

 #include<cstdio>
 #include<iostream>
 #include<algorithm>
 #include<string>
 #include<stack>
 #include<math.h>
 using namespace std;
 int hashTB[] = {}, block[] = {};
 stack<int> stk;
 int main(){
     int N, num;
     int bk = sqrt(100000.0);
     string ss;
     cin >> N;
     for(int i = ; i < N; i++){
         cin >> ss;
         if(ss == "Pop"){
             if(stk.empty() == false){
                 num = stk.top();
                 cout << num << endl;
                 stk.pop();
                 hashTB[num]--;
                 block[num / bk]--;
             }else{
                 cout << "Invalid"  << endl;
             }
         }else if(ss == "Push"){
             cin >> num;
             stk.push(num);
             hashTB[num]++;
             block[num / bk]++;
         }else if(ss == "PeekMedian"){
             if(stk.empty() == true){
                 cout << "Invalid" << endl;
             }else{
                 int cnt = stk.size(), j = , sum = ;
                 if(cnt %  == )
                     cnt = cnt / ;
                 else cnt = (cnt + ) / ;
                 while(sum < cnt && j < bk){
                     sum += block[j];
                     j++;
                 }
                 j--;
                 sum = sum - block[j];
                 for(j = j * bk; j < ; j++){
                     sum += hashTB[j];
                     if(sum >= cnt){
                         cout << j << endl;
                         break;
                     }
                 }
             }
         }
     }
     return ;
 }

总结：

1、超时了三个点，先这样吧，以后有时间再想想。用一个stack来同步模拟题中的push与pop操作。另使用一个hash表维护每个元素出现的次数。需要中位数时，就从头开始累加次数，直到达到中位数为止。为了加快速度，还可以将hash表分成N块，相当于建立一个索引表，存储每一块块内的元素个数。这样就可以先搜索块，次数差不多之后，再进入该块内搜索。分块的下标、循环条件等等不好想时，先简化成只有2块，每块50个元素来类比。

2、记得每次提交都要把最后的cin去掉。

更新： 把cin cout string 换成 scanf printf 和 char [ ] 竟然全过了。看来还是能不用cin cout就不用啊。下面是最新的代码。

 #include<cstdio>
 #include<iostream>
 #include<algorithm>
 #include<string>
 #include<stack>
 #include<math.h>
 using namespace std;
 int hashTB[] = {}, block[] = {};
 stack<int> stk;
 int main(){
     int N, num;
     int bk = sqrt(100000.0);
     char ss[];
     scanf("%d", &N);
     for(int i = ; i < N; i++){
         scanf("%s", ss);
         if(ss[] == 'o'){
             if(stk.empty() == false){
                 num = stk.top();
                 printf("%d\n", num);
                 stk.pop();
                 hashTB[num]--;
                 block[num / bk]--;
             }else{
                 printf("Invalid\n");
             }
         }else if(ss[] == 'u'){
             scanf("%d", &num);
             stk.push(num);
             hashTB[num]++;
             block[num / bk]++;
         }else if(ss[] == 'e'){
             if(stk.empty() == true){
                 printf("Invalid\n");
             }else{
                 int cnt = stk.size(), j = , sum = ;
                 if(cnt %  == )
                     cnt = cnt / ;
                 else cnt = (cnt + ) / ;
                 while(sum < cnt && j < bk){
                     sum += block[j];
                     j++;
                 }
                 j--;
                 sum = sum - block[j];
                 for(j = j * bk; j < ; j++){
                     sum += hashTB[j];
                     if(sum >= cnt){
                         printf("%d\n", j);
                         break;
                     }
                 }
             }
         }
     }
     cin >> num;
     return ;
 }