2050騫達紝浜虹被涓庡鏄熶漢涔嬮棿鐨勬垬浜夊凡瓚嬩簬鐧界儹鍖栥傚氨鍦ㄨ繖鏃訛紝浜虹被鍙戞槑鍑轟竴縐嶈秴綰ф鍣紝榪欑姝﹀櫒鑳藉鍚屾椂瀵圭浉閭葷殑澶氫釜鐩爣榪涜鏀誨嚮銆傚嚒鏄槻寰″姏灝忎簬鎴栫瓑浜? 榪欑姝﹀櫒鏀誨嚮鍔涚殑澶栨槦浜洪伃鍒板畠鐨勬敾鍑伙紝灝變細琚秷鐏傜劧鑰岋紝鎷ユ湁瓚呯駭姝﹀櫒鏄繙榪滀笉澶熺殑錛屼漢浠繕闇瑕佷竴涓垬鍦扮粺璁＄郴緇熸椂鍒誨弽棣堝鏄熶漢閮ㄩ槦鐨勪俊鎭傝繖涓壈宸ㄧ殑浠? 鍔¤惤鍦ㄤ綘鐨勮韓涓娿傝浣犲敖蹇璁″嚭榪欐牱涓濂楃郴緇熴?
榪欏緋葷粺闇瑕佸叿澶囪兘澶熷鐞嗗涓?綾諱俊鎭殑鑳藉姏錛?
1.澶栨槦浜哄悜[x1錛寈2]鍐呯殑姣忎釜浣嶇疆澧炴彺涓鏀槻寰″姏涓簐鐨勯儴闃熴?/p>
2.浜虹被浣跨敤瓚呯駭姝﹀櫒瀵筟x1錛寈2]鍐呯殑鎵鏈変綅緗繘琛屼竴嬈℃敾鍑誨姏涓簐鐨勬墦鍑匯傜郴緇熼渶瑕佽繑鍥炲湪榪欐鏀誨嚮涓娑堢伃鐨勫鏄熶漢涓暟銆?
娉細闃插盡鍔涗負i鐨勫鏄熶漢閮ㄩ槦鐢眎涓鏄熶漢緇勬垚錛屽叾涓j涓鏄熶漢鐨勯槻寰″姏涓簀銆?/p>
杈撳叆鏍煎紡
浠庢枃浠禼.in絎竴琛岃鍏錛宮銆傚叾涓璶琛ㄧず鏈塶涓綅緗紝m琛ㄧず鏈塵鏉′俊鎭?
浠ヤ笅鏈塵琛岋紝姣忚鏈?涓暣鏁発錛寈1錛寈2錛寁鐢ㄦ潵鎻忚堪涓鏉′俊鎭?銆俴琛ㄧず榪欐潯淇℃伅灞炰簬絎琸綾匯倄1錛寈2錛寁涓虹浉搴斾俊鎭殑鍙傛暟銆俴=1 or 2銆?/p>
娉細浣犲彲浠ヨ涓烘渶鍒濈殑鎵鏈変綅緗兘娌℃湁澶栨槦浜哄瓨鍦ㄣ?/p>
瑙勬ā錛?<n≤1000錛?<x1≤x2≤n錛?<v≤1000錛?<m≤2000
杈撳嚭鏍煎紡
緇撴灉杈撳嚭鍒版枃浠禼.out銆傛寜欏哄簭杈撳嚭闇瑕佽繑鍥炵殑淇℃伅銆?
杈撳叆鏍蜂緥
3 5
1 1 3 4
2 1 2 3
1 1 2 2
1 2 3 1
2 2 3 5
杈撳嚭鏍蜂緥
6
9
鏍蜂緥璇存槑
杈撳叆鏍蜂緥 瀵瑰簲杈撳嚭 杈撳嚭鏍蜂緥
3 5 鏃? 6
1 1 3 4 鏃? 9
2 1 2 3 6
1 1 2 2 鏃?br>1 2 3 1 鏃?br>2 2 3 5 9
棰樼洰鏉ユ簮 錛?a >OIBH 淇℃伅瀛︾粌涔犺禌 #6
棰樼洰鏍囩 錛?
浜岀淮(1) 綰挎鏍?/font>(1)
榪欎釜棰樼洰鐨勬爣絳炬槸浜岀淮+綰挎鏍?鎴戜及璁℃湁浜涘摜浠湡鐨勭敤浜岀淮綰挎鏍戞潵鍋氫簡,鏌ョ湅浜嗕竴涓嬪悗闈㈢殑浠ｇ爜,鍙戠幇澶у鏁扮殑浜虹殑浠ｇ爜閮借秴榪?k,鏈夌殑榪樿揪鍒皊鍥涗簲k涔嬪.鎴戠殑鎬濊礬鏄妸榪欎釜棰樼洰杞寲鎴愮煩褰㈠垏鍓叉潵鍋?x,y,v涓変釜鍙傛暟浠ュ強榛樿鐨勪竴涓垵濮嬪間唬琛ㄤ簡涓涓煩褰㈠尯鍩?宸︿笅瑙?x1,y1)=(x,1),鍙充笂瑙?x2,y2)=(y,v);
鍒囧壊鐨勫ぇ浣撴柟娉曟槸浠嶶SACO涓婄殑涓涓鐩鏉ョ殑,綾諱技鏈ㄥ潡涓婃誕,浠庣涓涓煩褰竴鐩存誕鍒版渶涓婇潰鐨勭煩褰?姣忕鍒頒竴涓伄鐩栫殑鐭╁艦灝卞垎瑁傚綋鍓嶇煩褰?鍦ㄤ笂嫻殑榪囩▼涓綆楀嚭姣忔璇㈤棶鐨勭瓟妗?
濡傛灉浣犲鐭╁艦鍒囧壊寰堜簡瑙?鐩鎬俊鎴戠殑浠ｇ爜榪樻槸姣旇緝瀹規槗鐞嗚В鐨?
1 #include<iostream>
2 using namespace std;
3 const int MAXM=3000+100;
4 struct rect
5 {
6 int x1,y1,x2,y2;
7 rect(){};
8 rect(int x1,int y1,int x2,int y2) : x1(x1),y1(y1),x2(x2),y2(y2) {}
9 }temp,q[MAXM];
10
11 int pos[MAXM],cp=0,ans[MAXM],n,m;
12 bool mark[MAXM];
13
14 inline bool is_parted(rect& a,rect& b)
15 {
16 return (a.x2<b.x1 || a.x1>b.x2 || a.y2<b.y1 || a.y1>b.y2);
17 }
18
19 void Cut(int p,rect cur)
20 {
21 if (p>cp) return;
22 while ( p<=cp && is_parted(cur,q[pos[p]]) ) ++p;
23 if (p>cp) return;
24 rect ques=q[pos[p]];
25 int area=(cur.y2-cur.y1+1)*(cur.x2-cur.x1+1);
26 if (cur.x1<ques.x1){
27 area-=(ques.x1-cur.x1)*(cur.y2-cur.y1+1);
28 rect temp=cur;
29 cur.x1=ques.x1;
30 temp.x2=ques.x1-1;
31 Cut(p+1,temp);
32 }
33 if (cur.x2>ques.x2){
34 area-=(cur.x2-ques.x2)*(cur.y2-cur.y1+1);
35 rect temp=cur;
36 cur.x2=ques.x2;
37 temp.x1=ques.x2+1;
38 Cut(p+1,temp);
39 }
40 if (cur.y2>ques.y2){
41 area-=(cur.y2-ques.y2)*(cur.x2-cur.x1+1);
42 rect temp=cur;
43 cur.y2=ques.y2;
44 temp.y1=ques.y2+1;
45 Cut(p+1,temp);
46 }
47 if (cur.y1<ques.y1){
48 area-=(ques.y1-cur.y1)*(cur.x2-cur.x1+1);
49 rect temp=cur;
50 cur.y1=ques.y1;
51 temp.y2=ques.y1-1;
52 Cut(p+1,temp);
53 }
54 ans[p]+=area;
55 }
56
57 int main()
58 {
59 freopen("c.in","r",stdin);
60 freopen("c.out","w",stdout);
61 memset(mark,0,sizeof(mark));
62 cin >> n >> m;
63 for (int i=0;i<m;++i){
64 int k,x,y,v;
65 cin >> k >> x >> y >> v;
66 q[i]=rect(x,1,y,v);
67 if (k==2){
68 mark[i]=1;
69 pos[++cp]=i;
70 }
71 }
72
73 memset(ans,0,sizeof(ans));
74 int p=1;
75 for (int i=0;i<m;++i){
76 if (mark[i]) { ++p; continue; }
77 Cut(p,q[i]);
78 }
79 for (int i=1;i<=cp;++i) cout << ans[i] << endl;
80
81 return 0;
82 }
83
2 using namespace std;
3 const int MAXM=3000+100;
4 struct rect
5 {
6 int x1,y1,x2,y2;
7 rect(){};
8 rect(int x1,int y1,int x2,int y2) : x1(x1),y1(y1),x2(x2),y2(y2) {}
9 }temp,q[MAXM];
10
11 int pos[MAXM],cp=0,ans[MAXM],n,m;
12 bool mark[MAXM];
13
14 inline bool is_parted(rect& a,rect& b)
15 {
16 return (a.x2<b.x1 || a.x1>b.x2 || a.y2<b.y1 || a.y1>b.y2);
17 }
18
19 void Cut(int p,rect cur)
20 {
21 if (p>cp) return;
22 while ( p<=cp && is_parted(cur,q[pos[p]]) ) ++p;
23 if (p>cp) return;
24 rect ques=q[pos[p]];
25 int area=(cur.y2-cur.y1+1)*(cur.x2-cur.x1+1);
26 if (cur.x1<ques.x1){
27 area-=(ques.x1-cur.x1)*(cur.y2-cur.y1+1);
28 rect temp=cur;
29 cur.x1=ques.x1;
30 temp.x2=ques.x1-1;
31 Cut(p+1,temp);
32 }
33 if (cur.x2>ques.x2){
34 area-=(cur.x2-ques.x2)*(cur.y2-cur.y1+1);
35 rect temp=cur;
36 cur.x2=ques.x2;
37 temp.x1=ques.x2+1;
38 Cut(p+1,temp);
39 }
40 if (cur.y2>ques.y2){
41 area-=(cur.y2-ques.y2)*(cur.x2-cur.x1+1);
42 rect temp=cur;
43 cur.y2=ques.y2;
44 temp.y1=ques.y2+1;
45 Cut(p+1,temp);
46 }
47 if (cur.y1<ques.y1){
48 area-=(ques.y1-cur.y1)*(cur.x2-cur.x1+1);
49 rect temp=cur;
50 cur.y1=ques.y1;
51 temp.y2=ques.y1-1;
52 Cut(p+1,temp);
53 }
54 ans[p]+=area;
55 }
56
57 int main()
58 {
59 freopen("c.in","r",stdin);
60 freopen("c.out","w",stdout);
61 memset(mark,0,sizeof(mark));
62 cin >> n >> m;
63 for (int i=0;i<m;++i){
64 int k,x,y,v;
65 cin >> k >> x >> y >> v;
66 q[i]=rect(x,1,y,v);
67 if (k==2){
68 mark[i]=1;
69 pos[++cp]=i;
70 }
71 }
72
73 memset(ans,0,sizeof(ans));
74 int p=1;
75 for (int i=0;i<m;++i){
76 if (mark[i]) { ++p; continue; }
77 Cut(p,q[i]);
78 }
79 for (int i=1;i<=cp;++i) cout << ans[i] << endl;
80
81 return 0;
82 }
83
Chen Jiecao 2009-07-26 20:19 鍙戣〃璇勮
]]>1094. 鐝嶇彔欏歸摼
鏈変竴涓茬敱n涓弽鐝犵粍鎴愮殑鐝嶇彔欏歸摼錛岀弽鐝犵殑緙栧彿涓?..n錛屾瘡涓弽鐝犻兘鏈夊悇鑷殑浠峰鹼紝鎴戜滑鐢╳[i]琛ㄧず緙栧彿涓篿鐨勭弽鐝犵殑浠峰鹼紙娉ㄦ剰錛歸[i]鍙互灝忎簬 闆訛級錛屽凡鐭ヨ繖n涓弽鐝犵殑浠峰奸噺鎬誨拰鏄痭-1,鐜拌姹備綘鍦ㄩ」閾劇殑鏌愪釜浣嶇疆鏂紑錛屼嬌寰楁柇寮鍚庣殑鐝嶇彔閾炬弧瓚沖浜庝換鎰弅,鍓峩涓弽鐝犵殑浠峰奸噺鎬誨拰涓嶈秴榪噆-1. (瀵規柇寮鐨勪竴鐐硅鏄? 濡傛灉鍦ㄤ綅緗畃鏂紑, 閭ｄ箞寰楀埌鐨勭弽鐝犻摼灝嗕竴瀹氭槸p,p+1,...,n,1,2,...,p-1)
杈撳叆鏍煎紡
杈撳叆鏂囦歡鐨勭涓琛屾湁涓涓敮涓鐨勬暣鏁皀,
鎺ヤ笅鏉涓敤絀烘牸鍜屾崲琛岀闅斿紑鐨勬暣鏁板垎鍒〃紺簑[1],w[2],...,w[n]
杈撳嚭鏍煎紡
濡傛灉鏃犺В璇瘋緭鍑轟竴琛?Impossible"錛堜笉鍚紩鍙鳳級鍚﹀垯杈撳嚭涓涓暣鏁拌〃紺烘柇寮鍚庣殑鐝嶇彔閾劇涓涓弽鐝犵殑緙栧彿
杈撳叆鏍蜂緥
5
1 1 1 1 0
杈撳嚭鏍蜂緥
5
鏁版嵁瑙勬ā涓庣害瀹?/strong>
3≤n≤200,000 -1,000,000,000≤w[i]≤1,000,000,000
40%鐨勬祴璇曟暟鎹弧瓚硁≤1,000
棰樼洰鏉ユ簮 錛?a >OIBH 淇℃伅瀛︾粌涔犺禌 #8
浠ｇ爜:
1 #include<iostream>
2 using namespace std;
3 const int MAXN=200000+100;
4 long long n,w[MAXN<<1];
5 int main()
6 {
7 freopen("necklace.in","r",stdin);
8 freopen("necklace.out","w",stdout);
9 cin >> n;
10 for (int i=0;i<n;++i) cin >> w[i],w[i+n]=w[i];
11 long long len=0,tot=0;;
12 for (int i=0;i<n*2;++i)
13 {
14 if (tot+w[i]<=len) tot+=w[i],++len;
15 else
16 { tot=0; len=0; }
17 if (len==n) { cout << i-len+2 << endl; return 0; }
18 }
19 cout << "Impossible\n";
20 return 0;
21 }
22
23
鍩烘湰涓?灝辨槸鏋氫婦鐝嶇彔,濡傛灉鏌愪釜鐝嶇彔鍙互浣滀負絎竴棰楃弽鐝?閭ｄ箞鎺ョ潃鎶婂畠鐨勪笅涓棰楀綋浣滅浜岄,濡傛灉鍚堟硶,緇х畫涓嬩竴棰?濡傛灉涓嶅悎娉?鐩存帴鎶婂綋鍓嶄笉鍚堟硶鐨勮繖涓棰楃殑涓嬩竴棰楀綋浣滅涓棰楃戶緇灇涓?2 using namespace std;
3 const int MAXN=200000+100;
4 long long n,w[MAXN<<1];
5 int main()
6 {
7 freopen("necklace.in","r",stdin);
8 freopen("necklace.out","w",stdout);
9 cin >> n;
10 for (int i=0;i<n;++i) cin >> w[i],w[i+n]=w[i];
11 long long len=0,tot=0;;
12 for (int i=0;i<n*2;++i)
13 {
14 if (tot+w[i]<=len) tot+=w[i],++len;
15 else
16 { tot=0; len=0; }
17 if (len==n) { cout << i-len+2 << endl; return 0; }
18 }
19 cout << "Impossible\n";
20 return 0;
21 }
22
23
涓轟粈涔堟尅褰撳墠鐨勮繖棰楃弽鐝犲湪榪欎釜浣嶇疆涓嶈,灝變笉鐢ㄥ湪鍒殑浣嶇疆灝濊瘯鍛?榪欐槸鍥犱負涓鏃︽煇棰楃弽鐝犱綔涓烘柇鎺変箣鍚庣殑閾劇k棰椾笉鍚堟硶鐨勮瘽,瀹冧篃涓瀹氫笉鍙兘鍦ㄥ綋浣滅1銆佺2........鎴栫k-1棰楁椂鍚堟硶,鐣ヨ瘉濡備笅:
鑻[1],A[2],A[3]......A[k-1] 浣滀負鍓?k-1)棰楃弽鐝犲悎娉?...............................................................................(1)
鑰孉[1]+A[2]+A[3]+......+A[k]>k-1 涓嶅悎娉?..........................................................................................(2)
閭ｄ箞鎴戜滑鏈?br>A[t+1]+A[t+1]+......+A[k]>k-1-(A[1]+A[2]+......+A[t]) (1<=t<k).............................................(3)
(1)==> A[1]+A[2]+.......A[t]<=t-1
鎵浠ョ敱(3)鐭?A[t+1]+A[t+2]+......A[k]>k-1-(t-1)=k-t...........................................................................(4)
鑰岃鎯蟲妸A[t+1],A[t+2],.......A[k]褰撲綔絎?,2,.........(k-t)棰楃弽鐝犱笖鍚堟硶,蹇呴』鏈?br>A[t+1]+A[t+2]+.......A[k]<=k-t-1 (鏈塳-t棰楃彔瀛?..................................................................................(5)
(4),(5)鐭涚浘,鎵浠ョ孩鑹查儴鍒嗗緱璇?
Chen Jiecao 2009-07-22 15:15 鍙戣〃璇勮
]]>