锘??xml version="1.0" encoding="utf-8" standalone="yes"?>亚洲欧美日韩国产一区二区,欧美精品导航,国产偷国产偷精品高清尤物http://m.shnenglu.com/SHFACM/category/9439.htmlACMzh-cnThu, 05 Feb 2009 14:45:51 GMTThu, 05 Feb 2009 14:45:51 GMT60zoj 1015(寮﹀浘)http://m.shnenglu.com/SHFACM/articles/72990.htmlSHFACMSHFACMWed, 04 Feb 2009 08:21:00 GMThttp://m.shnenglu.com/SHFACM/articles/72990.htmlhttp://m.shnenglu.com/SHFACM/comments/72990.htmlhttp://m.shnenglu.com/SHFACM/articles/72990.html#Feedback0http://m.shnenglu.com/SHFACM/comments/commentRss/72990.htmlhttp://m.shnenglu.com/SHFACM/services/trackbacks/72990.html鏃犲悜鍥句腑錛屽鏋滀換鎰忚竟鏁板ぇ浜?鐨勭幆錛岃嚦灝戝瓨鍦ㄤ竴鏉¤竟榪炴帴鐜腑涓嶇浉閭葷殑鏌愪袱
涓偣錛屽垯縐版鍥句負寮﹀浘(Chordal Graph)錛屾墍浠ヨ榪欓噷鐨勭畻娉曞氨鏄?br> 絎竴姝ワ細緇欒妭鐐圭紪鍙?br> 璁懼凡緙栧彿鐨勮妭鐐歸泦鍚堜負A錛屾湭緙栧彿鐨勮妭鐐歸泦鍚?
 1 /*
 2 鏃犲悜鍥句腑錛屽鏋滀換鎰忚竟鏁板ぇ浜?鐨勭幆錛岃嚦灝戝瓨鍦ㄤ竴鏉¤竟榪炴帴鐜腑涓嶇浉閭葷殑鏌愪袱
 3 涓偣錛屽垯縐版鍥句負寮﹀浘(Chordal Graph)
 4 */
 5 #include <iostream>
 6 using namespace std;
 7 int n,m;
 8 bool map[1001][1001];
 9 bool used[1001];
10 int seta[1001];
11 void number()
12 {
13       memset(used,0,sizeof(used));
14       used[1]=1;
15       seta[n]=1;
16       for(int num=n-1;num>=1;--num)
17       {
18             int Max=0;
19             int p=0;
20             for(int i=1;i<=n;++i)
21                   if(!used[i])
22                   {
23                         int sum=1;
24                         for(int k=n;k>=num;--k)
25                               if(map[i][seta[k]])
26                                     sum++;
27                         if(sum>Max)
28                         {
29                               Max=sum;
30                               p=i;
31                         }
32                   }
33             seta[num]=p;
34             used[p]=1;
35       }
36 }
37 bool check()
38 {
39       int setc[1001];
40       for(int i=1;i<n;++i)
41       {
42             int x=seta[i];
43             int k=0;
44             for(int j=i+1;j<=n;++j)
45             {
46                   int y=seta[j];
47                   if(map[x][y])
48                         setc[k++]=y;
49             }
50             if(k>1)
51             {
52                   for(int j=1;j<k;j++)
53                         if(!map[setc[0]][setc[j]])return 0;
54             }
55       }
56       return true;
57 }
58 int main()
59 {
60       int a,b;
61       while(scanf("%d%d",&n,&m)&&n)
62       {
63             memset(map,0,sizeof(map));
64             for(int i=1;i<=m;++i)
65             {
66                   scanf("%d%d",&a,&b);
67                   map[b][a]=map[a][b]=1;
68             }
69             //緙栧彿
70             number();
71             if(check())printf("Perfect\n\n");
72             else printf("Imperfect\n\n");
73       }
74       return 0;
75 }
涓築
寮濮嬫椂A涓虹┖錛孊鍖呭惈鎵鏈夎妭鐐廣?br> for num=n-1 downto 0 do
{
鍦˙涓壘鑺傜偣x錛屼嬌涓巟鐩擱偦鐨勫湪A闆嗗悎涓殑鑺傜偣鏁版渶澶氾紝灝唜緙栧彿涓簄um錛?br> 騫朵粠B縐誨叆A
}
絎簩姝ワ細媯鏌?br> for num=0 to n-1 do
{
瀵圭紪鍙蜂負num鐨勮妭鐐箈錛岃鎵鏈夌紪鍙峰ぇ浜巒um涓斾笌x鐩擱偦鐨勮妭鐐歸泦鍚堜負C錛?br> 鍦ㄩ泦鍚圕涓壘鍑虹紪鍙鋒渶灝忕殑鑺傜偣y錛屽鏋滈泦鍚圕涓瓨鍦ㄤ笉絳変簬y鐨勮妭鐐箊錛?br> 涓攜涓巣闂存病鏈夎竟錛屽垯姝ゅ浘涓嶆槸寮﹀浘錛岄鍑恒?br> }
媯鏌ュ畬浜嗭紝鍒欐鍥炬槸寮﹀浘銆?



SHFACM 2009-02-04 16:21 鍙戣〃璇勮
]]>usaco telecowhttp://m.shnenglu.com/SHFACM/articles/72929.htmlSHFACMSHFACMTue, 03 Feb 2009 11:37:00 GMThttp://m.shnenglu.com/SHFACM/articles/72929.htmlhttp://m.shnenglu.com/SHFACM/comments/72929.htmlhttp://m.shnenglu.com/SHFACM/articles/72929.html#Feedback0http://m.shnenglu.com/SHFACM/comments/commentRss/72929.htmlhttp://m.shnenglu.com/SHFACM/services/trackbacks/72929.html娉ㄦ剰鎶婄偣鎷嗗紑鏃惰竟鐨勮漿鍙橈細鎶婃瘡涓偣i鎷嗘垚涓や釜鐐筰1,i2錛岃繖涓や釜鐐逛箣闂村緩绔嬩竴鏉¤竟鏉冧負1鐨勬湁鍚戝姬銆傚浜庡師鍥句腑杈?i,j)錛屽緩绔?i2,j1)鍜?j2,i1)涓ゆ潯杈規潈涓?#8734;鐨勬湁鍚戝姬銆傚浜庢瘡涓偣i錛堥潪c1,c2錛夛紝鎶婅竟(i1,i2)鍘繪帀錛屾眰鏈澶ф祦錛岃涓簄owflow錛岃褰撳墠鎵懼埌鐨勬渶灝忓壊闆嗕腑鍏冪礌鐨勬暟閲忎負cnt銆傚鏋? netflow-cnt=nowflow+1錛岄偅涔堢偣i涓瀹氭槸鏈灝忓壊闆嗕腑鐨勫壊鐐癸紝璁板綍涓嬫潵銆傚惁鍒欏皢杈?i1,i2)閲嶆柊鍔犱笂銆傜洿鍒? cnt=netflow錛屽綋鍓嶆壘鐨勯泦鍚堝氨鏄渶灝忓壊闆嗐?br>
 1 #include<iostream>
 2 using namespace std;
 3 int n,m,s,t;
 4 int graph[101*2][101*2];//孌嬬暀緗戠粶
 5 int cp[101*2][202];
 6 int Edmonds_Karp(int s,int t)
 7 {
 8       int flow=0;
 9       int cp[101*2];
10       int pre[101*2];
11       int que[100000];
12       while(true)
13       {
14             cp[s]=INT_MAX;
15             memset(pre,0,sizeof(pre));
16             int head=0,tail=1;que[0]=s; 
17             while(head!=tail)
18             {
19                   int i=que[head++];
20                   for(int j=1;j<=2*n;j++)    //鑺傜偣浠?綆楄搗
21                         if(j != i && !pre[j] && graph[i][j]>0)
22                         {
23                               cp[j]=min(cp[i],graph[i][j]);
24                               que[tail++]=j;
25                               pre[j]=i;
26                         }
27             }
28             if(pre[t]==0)break;
29             int i=t;
30             while(i!=s)
31             {
32                   int j=pre[i];
33                   graph[j][i]-=cp[t];
34                   graph[i][j]+=cp[t];
35                   i=j;
36             }
37             flow+=cp[t];
38       }
39       return flow;
40 }
41 int main()
42 {
43       int a,b;
44       freopen("telecow.in","r",stdin);
45       freopen("telecow.out","w",stdout);
46       scanf("%d%d%d%d",&n,&m,&s,&t);
47       for(int i=1;i<=n;++i)
48             graph[2*i-1][2*i]=1;
49       for(int i=1;i<=m;++i)
50       {
51             scanf("%d%d",&a,&b);
52             graph[2*b][2*a-1]=graph[2*a][2*b-1]=INT_MAX;
53       }
54       for(int i=1;i<=n;++i)
55             graph[2*t][2*i-1]=graph[2*i][s*2-1]=0;
56       memcpy(cp,graph,sizeof(graph));
57       int Max;
58       printf("%d\n",Max=Edmonds_Karp(2*s,2*t-1));
59       bool flag=1;
60      for(int i=1;i<=n;++i)
61       {
62             if(i==s||i==t)continue;
63             memcpy(graph,cp,sizeof(cp));
64             graph[2*i-1][2*i]=0;
65             int tmp=Edmonds_Karp(2*s,2*t-1);
66             cp[2*i-1][2*i]=1;
67             if(tmp+1==Max)
68             {
69                   if(flag)
70                   {
71                         printf("%d",i);
72                         flag=0;
73                   }
74                   else printf(" %d",i);
75                   cp[2*i-1][2*i]=0;
76                   Max=tmp;
77             }
78       }
79      printf("\n");
80       return 0;
81 }
82 



SHFACM 2009-02-03 19:37 鍙戣〃璇勮
]]>usaco rectbarnhttp://m.shnenglu.com/SHFACM/articles/72903.htmlSHFACMSHFACMTue, 03 Feb 2009 06:28:00 GMThttp://m.shnenglu.com/SHFACM/articles/72903.htmlhttp://m.shnenglu.com/SHFACM/comments/72903.htmlhttp://m.shnenglu.com/SHFACM/articles/72903.html#Feedback0http://m.shnenglu.com/SHFACM/comments/commentRss/72903.htmlhttp://m.shnenglu.com/SHFACM/services/trackbacks/72903.html鏋佸ぇ鍖栨濇兂鐨勫簲鐢紒
鐢╨錛宺鍒嗗埆璁板綍浜嗕箣鍓嶇殑鐘舵侊紒
涓嬩竴嬈℃煡鎵劇殑鏃跺欏彧闇瑕乷(1)鐨勬椂闂達紝鏈鍧忔儏鍐典笅鏄痮(n),涓嶈繃鐢變簬鍧忕偣寰堢█鐤忥紝鏈鍧忔儏鍐靛緢灝戝彂鐢燂紒
鎵浠ョ▼搴忛潪甯稿揩錛?br> 
   Test 1: TEST OK [0.000 secs, 11544 KB]
   Test 2: TEST OK [0.011 secs, 11544 KB]
   Test 3: TEST OK [0.011 secs, 11544 KB]
   Test 4: TEST OK [0.011 secs, 11544 KB]
   Test 5: TEST OK [0.011 secs, 11544 KB]
   Test 6: TEST OK [0.022 secs, 11540 KB]
   Test 7: TEST OK [0.054 secs, 11544 KB]
   Test 8: TEST OK [0.194 secs, 11544 KB]
   Test 9: TEST OK [0.302 secs, 11540 KB]
   Test 10: TEST OK [0.281 secs, 11544 KB]
 1 鍔ㄦ佽鍒?br> 2 灝忕偒鑰涓涓?br> 3 紼嬪簭榪愯鐨勯潪甯稿揩涔堬紒
 4 /*
 5 ID: hongfei5
 6 PROG: rectbarn
 7 LANG: C++
 8 */
 9 #include<iostream>
10 using namespace std;
11 bool map[3001][3001];
12 int h[3001],l[3001],r[3001];
13 int n,m,p;
14 int main()
15 {
16       freopen("rectbarn.in","r",stdin);
17       freopen("rectbarn.out","w",stdout);
18       scanf("%d%d%d",&n,&m,&p);
19       int a,b;
20       for(int i=0;i<p;++i)
21       {
22             scanf("%d%d",&a,&b);
23             map[a][b]=1;//1琛ㄧず鏄潖鐐?/span>
24       }
25       h[0]=0;
26       int Max=0; 
27       //[i,j]涓?i,h[i,j])榪欐潯綰挎鍚戝乏杈規墿灞曠殑鏈闀胯窛紱伙紝r[i,j]涓?i,h[i,j])鍚戝彸杈規墿灞曠殑鏈闀胯窛紱?/span>
28       for(int i=1;i<=n;++i)
29       {
30             l[i]=0;
31             r[i]=m+1;
32             for(int j=1;j<=m;++j)
33                   if(map[i][j])
34                   {
35                         r[i]=j;
36                         break;
37                   }
38       }
39       for(int j=1;j<=m;++j)
40       {
41             int len_l=INT_MAX;
42             int len_r=INT_MAX;
43             for(int i=1;i<=n;++i)
44             { 
45                   if(map[i][j])
46                   {
47                         l[i]=j;
48                         h[i]=0;
49                         r[i]=m+1;
50                         len_l=len_r=INT_MAX;
51                         for(int k=j+1;k<=m;++k)
52                               if(map[i][k])
53                               {
54                                     r[i]=k;
55                                     break;
56                               }
57                   }
58                   else 
59                   {
60                         h[i]=h[i-1]+1;
61                         len_l=min(len_l,j-l[i]);
62                         len_r=min(len_r,r[i]-j);
63                         int s=(len_l+len_r-1)*h[i];
64                         if(s>Max)Max=s;
65                   }
66             }
67       }
68       printf("%d\n",Max); 
69       return 0;
70 }


SHFACM 2009-02-03 14:28 鍙戣〃璇勮
]]>usaco milk4http://m.shnenglu.com/SHFACM/articles/72820.htmlSHFACMSHFACMMon, 02 Feb 2009 10:28:00 GMThttp://m.shnenglu.com/SHFACM/articles/72820.htmlhttp://m.shnenglu.com/SHFACM/comments/72820.htmlhttp://m.shnenglu.com/SHFACM/articles/72820.html#Feedback0http://m.shnenglu.com/SHFACM/comments/commentRss/72820.htmlhttp://m.shnenglu.com/SHFACM/services/trackbacks/72820.html 1 dfsid+dp閫熷害騫朵笉鏄緢蹇紒
 2 #include<iostream>
 3 #include<algorithm>
 4 using namespace std;
 5 int q,n;
 6 bool dp[20001];
 7 int num[101];
 8 int ans[101];
 9 int pre[101];
10 void dfsid(int Max,int dep)
11 {
12       if(dep==Max+1)
13       {
14             memset(dp,0,sizeof(dp));
15             dp[0]=1;
16             for(int i=1;i<=Max;++i)
17                   for(int j=1;j<=q;++j)
18                         if(j>=ans[i])dp[j]=dp[j]|dp[j-ans[i]];
19             if(dp[q])
20             {
21                   printf("%d",Max);
22                   sort(ans+1,ans+Max);
23                   for(int i=1;i<=Max;++i)
24                         printf(" %d",ans[i]);
25                   printf("\n");
26                   exit(0);
27             }
28             return ;
29       }
30       for(int i=pre[dep-1]+1;i<=n-Max+dep;++i)
31       {
32             ans[dep]=num[i];
33             pre[dep]=i;
34             dfsid(Max,dep+1);
35       }
36 }
37 int main()
38 {
39       freopen("milk4.in","r",stdin);
40       freopen("milk4.out","w",stdout);
41       scanf("%d%d",&q,&n);
42       for(int i=1;i<=n;++i)
43             scanf("%d",&num[i]);
44       for(int i=1;i<=n;++i)
45       {
46             pre[0]=0;
47             dfsid(i,1);
48       }
49       return 0;
50 }


SHFACM 2009-02-02 18:28 鍙戣〃璇勮
]]>usaco themehttp://m.shnenglu.com/SHFACM/articles/72791.htmlSHFACMSHFACMMon, 02 Feb 2009 04:05:00 GMThttp://m.shnenglu.com/SHFACM/articles/72791.htmlhttp://m.shnenglu.com/SHFACM/comments/72791.htmlhttp://m.shnenglu.com/SHFACM/articles/72791.html#Feedback0http://m.shnenglu.com/SHFACM/comments/commentRss/72791.htmlhttp://m.shnenglu.com/SHFACM/services/trackbacks/72791.html 浼樺寲錛?br>錛?錛夊鏋滀互i寮澶寸殑闀垮害涓簂鐨勫簭鍒楁病鏈夊尮閰嶅簭鍒楋紝閭ｄ箞姣攍鏇撮暱鐨勫簭鍒椾竴瀹氫笉浼氭湁瑙ｏ紝鍙互鐩存帴璺寵繃銆?
1 (1)綰ā鎷?/span>-涓嬈¤繃
 2 #include<iostream>
 3 using namespace std;
 4 int n;
 5 int s[5001];
 6 int main()
 7 {
 8       freopen("theme.in","r",stdin);
 9       freopen("theme.out","w",stdout);
10       int i,j;
11       scanf("%d",&n);
12       for (i=0;i<n;++i)
13             scanf("%d",&s[i]);
14       int Max=1;
15       for(int i=0;i+2*Max-1<n;++i)
16       {
17             for(int j=i+Max-1;j+Max-1<n;++j)
18             {
19                   int k=1;
20                   while(1)
21                   {
22                         if(i+Max>=j)break;
23                         if(s[i+k]-s[j+k]==s[i]-s[j])
24                         {
25                               k++;
26                               if(k>Max)Max=k;
27                         }
28                         else break;
29                   }
30             }
31       }
32       if(Max>=5)printf("%d\n",Max);
33       else printf("0\n");
34       return 0;
35 }
 1 (2)鍔ㄦ佽鍒?br> 2 //絀洪棿涓嶅
 3 #include<iostream>
 4 using namespace std;
 5 int n;
 6 char s[5001];
 7 char dp[5001][5001];
 8 int main()
 9 {
10       freopen("theme.in","r",stdin);
11       freopen("theme.out","w",stdout);
12       int i,j;
13       scanf("%d",&n);
14       for (i=0;i<n;++i)
15             scanf("%d",&s[i]);
16       for(i=0;i<n;++i)
17             for(j=0;j<n;++j)
18                   dp[i][j]=1;
19       int Max=1;
20       for(i=n-2;i>=0;--i)
21             for(j=n-2;j>=0;--j)
22             {
23                   if(i==j)continue;
24                   if(i+dp[i+1][j+1]>=j)continue;
25                   if(s[j+1]-s[j]==s[i+1]-s[i])
26                         dp[i][j]=dp[i+1][j+1]+1;
27                   if(dp[i][j]>Max)Max=dp[i][j];
28             }
29       if(Max>=5)printf("%d\n",Max);
30       else printf("0\n");
31       return 0;
32 }



SHFACM 2009-02-02 12:05 鍙戣〃璇勮
]]>usaco jobhttp://m.shnenglu.com/SHFACM/articles/72772.htmlSHFACMSHFACMSun, 01 Feb 2009 14:15:00 GMThttp://m.shnenglu.com/SHFACM/articles/72772.htmlhttp://m.shnenglu.com/SHFACM/comments/72772.htmlhttp://m.shnenglu.com/SHFACM/articles/72772.html#Feedback0http://m.shnenglu.com/SHFACM/comments/commentRss/72772.htmlhttp://m.shnenglu.com/SHFACM/services/trackbacks/72772.html絎竴闂瘮杈冪畝鍗曪紝鐢ㄨ椽蹇冨仛灝卞彲浠ヤ簡銆傜敤now[i]璁板綍A涓満鍣ㄥ伐浣滅殑鏃墮棿錛屽垵濮嬫椂涓?銆傛瘡嬈′嬌褰撳墠鏈澶у伐浣滄椂闂存渶灝忥紝鍗蟲壘鍒頒竴涓猨浣垮緱 now[j]+t[j]鏈灝忥紝鍏朵腑t鏄疉涓満鍣╦瀹屾垚涓嬈℃搷浣滅殑鏃墮棿銆傝鏈哄櫒j瀹屾垚榪欐鎿嶄綔錛屾洿鏂皀ow[i]錛屽悓鏃惰褰曠i浠跺伐浣滆瀹屾垚鐨勬椂闂? fin[i]銆?/p>

璐績鐨勮瘉鏄庢瘮杈冨鏄擄紝榪欓噷灝變笉璇翠簡錛堝弽璇侊級銆?/p>

絎簩闂垵鐪嬩技涔庢棤浠庝笅鎵嬶紝鎴戜滑涓嶅Θ鎹釜瑙掑害錛屾妸A鍜孊鐙珛寮錛屾崲鍙ヨ瘽璇達紝絳堿宸ヤ綔鍏ㄩ儴緇撴潫鍚嶣宸ヤ綔鎵嶅紑濮嬶紝閭ｄ箞B鍜孉鏄竴鏍風殑錛岀敤璐績姹傚嚭榪欐椂姣忎歡宸ヤ綔琚畬鎴愮殑鏃墮棿sta[i]銆?/p>

fin鍜宻ta涓殑鏁版槸鍗曡皟閫掑鐨勶紝鎴戜滑璁炬兂涓涓嬶紝鎶奻in涓渶澶х殑鍜宻ta涓渶灝忕殑鏁板搴旓紝璁板仛鏌愪歡宸ヤ綔瀹屾垚鐨勬椂闂達紙鍥犱負鎵鏈夊伐浣滈兘鏄竴鏍風殑錛夛紝fin涓澶х殑鍜宻ta涓澶х殑鏁板搴旓紝璁板仛鍙︿竴浠跺伐浣滃畬鎴愮殑鏃墮棿錛屼緷姝ょ被鎺ㄣ傚幓鎵鏈夌殑瀹屾垚鏃墮棿鏈澶х殑灝辨槸闂浜岀殑瑙ｃ?/p>

鍗曡皟鎬?/span>

榪欎釜鍥懼彲鑳芥洿褰㈣薄涓浜涳細

0 && image.height>0){if(image.width>=700){this.width=700;this.height=image.height*700/image.width;}}" src="http://photo.hexun.com/p/2006/0131/9642/b_15D7B52B56948D55.jpg" alt="鏌ョ湅鏇村綺懼僵鍥劇墖" border="0">

SHFACM 2009-02-01 22:15 鍙戣〃璇勮
]]>usaco windowhttp://m.shnenglu.com/SHFACM/articles/72735.htmlSHFACMSHFACMSat, 31 Jan 2009 03:26:00 GMThttp://m.shnenglu.com/SHFACM/articles/72735.htmlhttp://m.shnenglu.com/SHFACM/comments/72735.htmlhttp://m.shnenglu.com/SHFACM/articles/72735.html#Feedback0http://m.shnenglu.com/SHFACM/comments/commentRss/72735.htmlhttp://m.shnenglu.com/SHFACM/services/trackbacks/72735.html  1 #include<iostream>
  2 using namespace std;
  3 struct Rect
  4 {
  5       int x1,y1,x2,y2;//鍒嗗埆涓哄乏涓婅鍜屽彸涓嬭(宸︿笂瑙掍負鏈灝忕殑妯旱鍧愭爣)
  6       int level;//鏍囪瘑絎?/span>
  7       int s;//闈㈢Н涓?琛ㄧず涓嶅瓨鍦?/span>
  8 }rect[100],que[50000],now;
  9 int Max,Min;
 10 int front,rail;
 11 int cal(char a)
 12 {
 13       if(a<='9'&&a>='0')return a-'0';
 14       if(a<='Z'&&a>='A')return a-'A'+10;
 15       if(a<='z'&&a>='a')return a-'a'+36;
 16 }
 17 void t(char a)
 18 {
 19       rect[cal(a)].level=++Max;
 20 }
 21 void b(char a)
 22 {
 23       rect[cal(a)].level=--Min;
 24 }
 25 void d(char a)
 26 {      
 27       rect[cal(a)].s=0;
 28 }
 29 void w(char a,int x1,int y1,int x2,int y2)
 30 {
 31       t(a);
 32       rect[cal(a)].x1=x1;
 33       rect[cal(a)].x2=x2;
 34       rect[cal(a)].y1=y1;
 35       rect[cal(a)].y2=y2;
 36       rect[cal(a)].s=(y2-y1)*(x2-x1);
 37 }
 38 bool cross(int x1,int x2,int x3,int x4)//涓ゆ潯綰挎 x1-x2,x3-x4
 39 {
 40       if(x2<=x3||x4<=x1)return false;
 41       return true;
 42 }
 43 void add(int x1,int y1,int x2,int y2,int level)
 44 {
 45       que[rail].x1=x1;
 46       que[rail].x2=x2;
 47       que[rail].y1=y1;
 48       que[rail].y2=y2;
 49       que[rail].level=level;
 50       rail++;
 51 }
 52 void cut(int x1,int y1,int x2,int y2,int dir,int k,int level)
 53 {
 54       int k1,k2;
 55       switch(dir)
 56       {
 57             //鍏堜粠x鏂瑰悜鍒?/span>
 58       case 1:
 59             {
 60                   k1=max(x1,rect[k].x1);
 61                   k2=min(x2,rect[k].x2);
 62                   if(x1<k1)add(x1,y1,k1,y2,level);
 63                   if(k2<x2)add(k2,y1,x2,y2,level);
 64                   cut(k1,y1,k2,y2,dir+1,k,level);
 65                   break;
 66             }
 67             //鍐嶄粠y鏂瑰悜鍒?/span>
 68       case 2:
 69             {
 70                   k1=max(y1,rect[k].y1);
 71                   k2=min(y2,rect[k].y2);
 72                   if(y1<k1)add(x1,y1,x2,k1,level);
 73                   if(k2<y2)add(x1,k2,x2,y2,level);
 74             }
 75       }
 76 }
 77 void s(char a)
 78 {
 79       front=0;
 80       rail=1;
 81       que[0]=rect[cal(a)];
 82       for(int k=0;k<62;++k)
 83       {
 84             if(rect[k].s==0)continue;
 85             if(rect[k].level<=rect[cal(a)].level)continue;
 86             int j=rail,i=front;
 87             while(i!=j)
 88             {
 89                   now=que[front++];
 90                   if(cross(now.x1,now.x2,rect[k].x1,rect[k].x2)&&cross(now.y1,now.y2,rect[k].y1,rect[k].y2))
 91                         cut(now.x1,now.y1,now.x2,now.y2,1,k,now.level);
 92                   else add(now.x1,now.y1,now.x2,now.y2,now.level);
 93                   i++;
 94             }
 95       }
 96       int sum=0;
 97       for(int s=front;s<rail;++s)
 98             sum+=(que[s].y2-que[s].y1)*(que[s].x2-que[s].x1);
 99       printf("%.3lf\n",(double)sum/(double)rect[cal(a)].s*100.0);
100 }
101 int main()
102 {      
103       freopen("window.in","r",stdin);
104       freopen("window.out","w",stdout);
105       char tmp;
106       char a;
107       int x1,y1,x2,y2;
108       Max=Min=0;
109       while(1)
110       {
111             if(scanf("%c",&tmp)==-1)break;
112             if(tmp=='w')
113             {
114                   scanf("(%c,%d,%d,%d,%d)",&a,&x1,&y1,&x2,&y2);
115                   if(x1>x2)swap(x1,x2);
116                   if(y1>y2)swap(y1,y2);
117                   w(a,x1,y1,x2,y2);
118             }
119             else if(tmp=='t')
120             {
121                   scanf("(%c)",&a);
122                   t(a);
123             }
124             else if(tmp=='b')
125             {
126                   scanf("(%c)",&a);
127                   b(a);
128             }
129             else if(tmp=='d')
130             {
131                   scanf("(%c)",&a);
132                   d(a);
133             }
134             else if(tmp=='s')
135             {
136                   scanf("(%c)",&a);
137                   s(a);
138             }
139             getchar();
140       }
141       return 0;
142 }


SHFACM 2009-01-31 11:26 鍙戣〃璇勮
]]> 青青草原综合久久大伊人导航_色综合久久天天综合_日日噜噜夜夜狠狠久久丁香五月_热久久这里只有精品

    • <ins id="pjuwb"></ins>
    <blockquote id="pjuwb"><pre id="pjuwb"></pre></blockquote>

    <noscript id="pjuwb"></noscript>
          <sup id="pjuwb"><pre id="pjuwb"></pre></sup>

            <dd id="pjuwb"></dd>
            <abbr id="pjuwb"></abbr>
            
久久人人看视频|
欧美色欧美亚洲高清在线视频|
欧美成人综合一区|
久久精品首页|
久久人人超碰|
欧美大片网址|
亚洲欧洲中文日韩久久av乱码|
欧美黑人国产人伦爽爽爽|
亚洲国产精品成人|
亚洲最新合集|
先锋影音久久|
美女图片一区二区|
欧美日韩一区二区欧美激情
|
欧美视频中文在线看|
亚洲欧洲一级|
欧美专区亚洲专区|
国产精品vvv|
另类图片国产|
亚洲激情视频在线观看|
日韩亚洲欧美综合|
小黄鸭精品密入口导航|
久久亚洲一区二区三区四区|
欧美日韩国产一区二区三区|
国产九区一区在线|
亚洲国产精品电影在线观看|
亚洲一区二区免费在线|
免费成人黄色|
亚洲欧美视频在线观看|
在线亚洲高清视频|
国产精品日韩欧美综合|
亚洲伦理一区|
91久久精品国产91久久|
在线一区二区日韩|
久久野战av|
国产精品美女www爽爽爽视频|
极品av少妇一区二区|
亚洲一区二区三区三|
久久综合九色欧美综合狠狠|
在线一区日本视频|
欧美va亚洲va日韩∨a综合色|
国产午夜一区二区三区|
亚洲一区视频在线观看视频|
欧美激情影音先锋|
久久精品国产久精国产爱|
欧美午夜精品久久久久久久|
亚洲精品国产欧美|
嫩草国产精品入口|
欧美中文字幕不卡|
国产欧美日韩另类一区|
亚洲尤物视频网|
亚洲精品之草原avav久久|
美乳少妇欧美精品|
激情久久中文字幕|
久久久久久网|
久久国产精品色婷婷|
久久一区二区三区国产精品|
亚洲精品一区中文|
久久亚洲综合色|
在线一区二区三区四区五区|
欧美精品精品一区|
亚洲高清免费|
欧美风情在线观看|
久久久久久综合|
国语自产精品视频在线看|
欧美一区二区三区免费视频|
亚洲一区一卡|
国产欧美va欧美va香蕉在|
欧美一级久久久|
午夜精品福利在线|
国产日韩一区二区三区在线播放|
久久精品视频在线观看|
欧美一区二区三区的|
国产一区二区三区的电影
|
国产情人节一区|
亚欧美中日韩视频|
欧美在线观看你懂的|
激情亚洲网站|
亚洲电影欧美电影有声小说|
欧美激情偷拍|
亚洲一区影音先锋|
香蕉av福利精品导航|
国产主播一区|
亚洲精品免费看|
亚洲黄网站在线观看|
亚洲激情网址|
国产精品久久久久久亚洲毛片|
午夜久久久久久|
欧美一区观看|
亚洲精品国产系列|
亚洲一区二区三区在线观看视频
|
亚洲精品欧美日韩|
在线亚洲欧美专区二区|
国产一区二区三区精品欧美日韩一区二区三区|
久久久久看片|
欧美日韩成人一区|
久久精品一区二区|
欧美黄色网络|
久久超碰97人人做人人爱|
老司机免费视频久久|
亚洲男人av电影|
久久综合免费视频影院|
亚洲一二三区视频在线观看|
久久精品国产清自在天天线|
欧美影院一区|
欧美激情综合色|
亚洲欧美日韩在线播放|
一区二区三区在线视频观看|
91久久精品网|
国产主播一区二区三区|
亚洲国产精品成人|
国产中文一区二区三区|
日韩午夜免费视频|
悠悠资源网久久精品|
亚洲视频在线二区|
亚洲国产欧美另类丝袜|
午夜精品美女久久久久av福利|
亚洲精品在线观|
久久久久国产精品人|
午夜精品久久久久久久久|
欧美激情在线免费观看|
久久夜色撩人精品|
欧美体内she精视频|
亚洲国产精品精华液2区45|
韩国女主播一区|
欧美一级视频精品观看|
亚洲女人小视频在线观看|
欧美日本亚洲|
欧美激情亚洲|
亚洲风情亚aⅴ在线发布|
欧美在线|欧美|
久久er精品视频|
国产精品一区二区三区成人|
日韩亚洲欧美成人一区|
夜夜爽www精品|
欧美精品色综合|
91久久精品国产|
亚洲精品一区二区网址|
欧美高清不卡|
亚洲国产精品一区|
亚洲七七久久综合桃花剧情介绍|
久久精品亚洲一区二区三区浴池|
久久夜色精品国产|
一区二区在线视频观看|
久久人人97超碰人人澡爱香蕉|
美国成人直播|
亚洲高清不卡一区|
噜噜噜在线观看免费视频日韩|
亚洲免费在线精品一区|
午夜日韩在线|
国产日韩在线亚洲字幕中文|
香蕉久久夜色精品国产|
欧美一区久久|
黄色精品免费|
噜噜噜久久亚洲精品国产品小说|
亚洲成色777777女色窝|
av成人免费在线观看|
欧美日韩在线观看视频|
亚洲欧美日本视频在线观看|
久久综合色影院|
亚洲精品视频一区二区三区|
狂野欧美激情性xxxx|
一区二区三区在线视频播放|
国产精品乱码一区二三区小蝌蚪
|
好吊日精品视频|
久久九九有精品国产23|
亚洲第一精品福利|
一本综合精品|
国产亚洲精品aa|
农村妇女精品|
亚洲一区二区不卡免费|
久久一二三国产|
在线视频欧美日韩|
国产一二三精品|
女同一区二区|
亚洲欧美日韩一区在线|
亚洲第一精品久久忘忧草社区|
亚洲一区视频在线观看视频|
国产一区二区三区黄|
欧美激情综合色|
久久国产一二区|
欧美激情日韩|
亚洲国产导航|
亚洲伊人网站|
欧美激情第3页|
欧美一区二区高清|
亚洲精品网址在线观看|
国产欧美精品日韩精品|
欧美精品免费在线观看|
欧美在线观看视频|
99精品黄色片免费大全|
免费欧美日韩国产三级电影|
亚洲在线播放|
99精品国产99久久久久久福利|
黑丝一区二区|
国产精品免费网站|
欧美另类高清视频在线|
免费亚洲电影在线|
欧美在线视频导航|
亚洲一区日韩|
国产精品99久久久久久久vr|