c0de4fun的完美算(nei)法(he)教室-我们仍不知道，那天调用的驱动的名字。

#include #include #include #include #define INPUT using namespace std; const int MAXSIZE = 50010; bool comp1(int a,int b) { return a>b; } int main() { #ifdef INPUT freopen("b:\\acm\\poj325

#include #include #include #include #include #include #include //#define INPUT using namespace std; /** Problem:POJ2442 - Sequence Begin Time : 2nd/March/2012 1:00 p.m. End Time: 2n

#include #include #include #include #include using namespace std; const int HEAPSIZE = 10; int heap[HEAPSIZE + 1]; int MAKEHEAP(int i ,int size) { int child,rootkey,tmp; tmp = heap[i];