NKU->lkjslkjdlk 2012-08-13 22:35 鍙戣〃璇勮
]]>鍥犱負棰樼洰鏁版嵁杈冨皬錛屾墍浠ュ彲浠ョ洿鎺ユā鎷熴?/span>
姣忚鍏ヤ竴涓懡浠ゆ墍瑕佽繘琛岀殑鎿嶄綔:
濡傛灉鏄痓uy,鍒欒縐嶄環(huán)鏍肩殑涔板叆鏁?ni錛屽皢璇ョ浠鋒牸鍔犲叆鍒頒拱鍏ヤ環(huán)鏍肩殑闆嗗悎涓?/span>
濡傛灉鏄痵ell,鍒欒縐嶄環(huán)鏍肩殑鍗栧嚭鏁?mi錛屽皢璇ョ浠鋒牸鍔犲叆鍒板崠鍑轟環(huán)鏍肩殑闆嗗悎涓?/span>
鐒跺悗榪涜閿鍞殑鎿嶄綔錛?/span>
姣旇緝鏈浣庣殑鍗栧嚭浠鋒牸鍜屾渶楂樼殑涔板叆浠鋒牸錛?/span>
濡傛灉鍓嶈呭皬浜庣瓑浜庡悗鑰呭垯錛?/span>
璁炬渶浣庡崠鍑轟環(huán)鏍肩殑鍗栧嚭鏁頒負a,鏈楂樹拱鍏ヤ環(huán)鏍肩殑涔板叆鏁頒負b.
鍒檃=a-min(a,b),b=b-min(a,b)
濡傛灉鍏朵腑鍗栧嚭鏁板彉涓?錛屽垯鍦ㄥ崠鍑轟環(huán)鏍奸泦鍚堜腑鍒犲幓璇ョ鍗栧嚭浠鋒牸銆備拱鍏ユ暟鍚岀悊銆?/span>
璁板綍鑲＄エ浠鋒牸
------------------------------------------------------------------------------------------------------
鐩村埌鏈浣庣殑鍗栧嚭浠鋒牸姣旀渶楂樼殑涔板叆浠鋒牸瑕侀珮鎴栬呭叾涓竴涓泦鍚堜負絀烘椂璺沖嚭銆?/span>
灝嗕綑涓嬫潵鏈浣庣殑鍗栧嚭鏁頒笉涓?鐨勫崠鍑轟環(huán)鏍艱緭鍑猴紝濡傛灉鍗栧嚭浠鋒牸闆嗗悎涓虹┖灝辮緭鍑?#8221;-”
涔板叆浠鋒牸鍚岀悊錛屾渶鍚庡啀杈撳嚭鑲＄エ浠鋒牸
榪欐牱灝卞畬鎴愪簡涓嬈″懡浠ょ殑鎿嶄綔
娉ㄦ剰鍗栧嚭浠鋒牸闆嗗悎涓虹┖鍜屼拱鍏ヤ環(huán)鏍奸泦鍚堜負絀烘椂鐨勬儏鍐?/span>
浠ｇ爜濡備笅:
1 //by NKU lkjslkjdlk
2 #include<cstdio>
3 #include<cstring>
4 #include<set>
5 using namespace std;
6 inline int min(int x,int y){return x<y?x:y;}
7 int cas,or_num,sto_pri,i,bid[1005],ask[1005],trade_num,trade_pri,min_de;
8 char order[100],tmp[10],bs[5],ch;
9 set<int> bids,asks;set<int>::reverse_iterator biter;set<int>::iterator aiter;
10 void print(){
11 if(asks.empty())printf("- ");else printf("%d ",*asks.begin());
12 if(bids.empty()) printf("- ");else printf("%d ",*bids.rbegin());
13 if(sto_pri==-1) printf("-\n");else printf("%d\n",sto_pri);
14 }
15 void sell(){
16 while(1){
17 biter=bids.rbegin();aiter=asks.begin();
18 if(*biter>=*aiter){
19 min_de=min(bid[*biter],ask[*aiter]);
20 bid[*biter]-=min_de;ask[*aiter]-=min_de;
21 sto_pri=*aiter;
22 if(bid[*biter]==0) bids.erase(*biter);
23 if(ask[*aiter]==0) asks.erase(*aiter);
24 }
25 if(asks.empty()||bids.empty()) break;
26 if(*asks.begin()>*bids.rbegin()) break;
27 }
28 }
29 int main()
30 {
31 scanf("%d",&cas);
32 while(cas--){
33 bids.clear();asks.clear();
34 memset(bid,0,sizeof(bid));memset(ask,0,sizeof(ask));
35 scanf("%d%c",&or_num,&ch);
36 for(i=0,sto_pri=-1;i<or_num;i++){
37 gets(order);sscanf(order,"%s %d %s %s %d",bs,&trade_num,tmp,tmp,&trade_pri);
38 if(!strcmp(bs,"buy")){
39 bids.insert(trade_pri);bid[trade_pri]+=trade_num;
40 if(!asks.empty()){sell();print();}else print();
41 }
42 else{
43 asks.insert(trade_pri);ask[trade_pri]+=trade_num;
44 if(!bids.empty()){sell();print();}else print();
45 }
46 }
47 }
48 return 0;
49 }
2 #include<cstdio>
3 #include<cstring>
4 #include<set>
5 using namespace std;
6 inline int min(int x,int y){return x<y?x:y;}
7 int cas,or_num,sto_pri,i,bid[1005],ask[1005],trade_num,trade_pri,min_de;
8 char order[100],tmp[10],bs[5],ch;
9 set<int> bids,asks;set<int>::reverse_iterator biter;set<int>::iterator aiter;
10 void print(){
11 if(asks.empty())printf("- ");else printf("%d ",*asks.begin());
12 if(bids.empty()) printf("- ");else printf("%d ",*bids.rbegin());
13 if(sto_pri==-1) printf("-\n");else printf("%d\n",sto_pri);
14 }
15 void sell(){
16 while(1){
17 biter=bids.rbegin();aiter=asks.begin();
18 if(*biter>=*aiter){
19 min_de=min(bid[*biter],ask[*aiter]);
20 bid[*biter]-=min_de;ask[*aiter]-=min_de;
21 sto_pri=*aiter;
22 if(bid[*biter]==0) bids.erase(*biter);
23 if(ask[*aiter]==0) asks.erase(*aiter);
24 }
25 if(asks.empty()||bids.empty()) break;
26 if(*asks.begin()>*bids.rbegin()) break;
27 }
28 }
29 int main()
30 {
31 scanf("%d",&cas);
32 while(cas--){
33 bids.clear();asks.clear();
34 memset(bid,0,sizeof(bid));memset(ask,0,sizeof(ask));
35 scanf("%d%c",&or_num,&ch);
36 for(i=0,sto_pri=-1;i<or_num;i++){
37 gets(order);sscanf(order,"%s %d %s %s %d",bs,&trade_num,tmp,tmp,&trade_pri);
38 if(!strcmp(bs,"buy")){
39 bids.insert(trade_pri);bid[trade_pri]+=trade_num;
40 if(!asks.empty()){sell();print();}else print();
41 }
42 else{
43 asks.insert(trade_pri);ask[trade_pri]+=trade_num;
44 if(!bids.empty()){sell();print();}else print();
45 }
46 }
47 }
48 return 0;
49 }
NKU->lkjslkjdlk 2011-10-11 00:50 鍙戣〃璇勮
]]>NKU->lkjslkjdlk 2011-10-11 00:39 鍙戣〃璇勮
]]>