256錛氳繖涔堟按鐨勯绔熺劧鎼炰簡30+min錛屼竴寮濮嬬背鐪嬭姣忛殧7澶╁氨瑕佷拱鍚屼竴縐嶏紝浠ヤ負鏄疍P錛岀粨鏋滄祴Sample3綾寵繃鍘伙紝浜庢槸閲嶅啓……錛堣鏈ㄦ湁Sample3灝辨澂鍏蜂簡錛?br />
512錛氱敱浜?56涓婂崱浜嗗お澶氭椂闂達紝榪欓鍦ㄥ揩鍐欏畬鐨勬椂鍊欏埌鏃墮棿浜?#8230;…
1024錛氱湅閮界背鐪?#8230;…
緇撴灉錛氬叏鍦?00+鍚?#8230;…浼拌涓嬫寰楁帀鍥濪IV2浜?#8230;…
]]>
榪欐鎬諱綋鎰熻榪樹笉鏄お宸紝涔熺畻姝ｅ父鍙戞尌浜?#8212;—铏界劧鏈鍚庤繕鏄背鏈夋悶瀹?000銆?50鍜?00涓ら亾姘撮鐨勯熷害搴旇榪樺彲浠ワ紙浠庢渶緇堝悕嬈℃潵鐪嬶級銆?br />鍙﹀錛孌IV2鍏ㄥ満鍙湁2浣嶇鐘囨悶瀹氫簡1000……
Orz AHdoc絳夌鐘?br />————————————————————————————————————
浠ヤ笅涓?000棰樿В錛堢湅鍒殑紲炵妵鐨勪唬鐮佹悶鎳傜殑錛夛細
璁綟[i][j]涓虹i杞紑濮嬫椂錛堣繕鏈嚭鐗屾椂錛夛紝闈㈠鐨勭姸鎬侊紙鍐呭瓨錛変負j錛屾槸鍚﹀繀鑳溿傝繖閲岃涓寮濮嬬殑閭ｄ竴杞負絎?杞?br />閫嗘帹i銆傛牴鎹畂r榪愮畻鐨勬ц川鍙互寰楀埌錛岃嫢鐩墠鍐呭瓨涓簀錛屾煇寮犲凡緇忓嚭榪囩殑鐗岀殑鍊間負K錛屽垯K鐨勪簩榪涘埗鐨勬墍鏈?浣嶅湪j涓搴旂殑浣嶄篃閮芥槸1錛堜篃灝辨槸j | K = j錛夛紝榪欐牱錛屾壂鎻忔瘡寮犵墝錛岃嫢鍏跺糑 | j鐨勫間笉絳変簬j錛屽垯璇ョ墝涓嶅彲鑳藉嚭榪囥傚洜姝わ紝鍙互鍦ㄧi杞嚭榪欏紶鐗岋紝鑻ヨ嚦灝戞湁涓涓狥[i + 1][K | j]涓哄繀璐ョ姸鎬佸垯F[i][j]涓哄繀鑳滅姸鎬併?br />瀵逛簬K | j鐨勫肩瓑浜巎鐨勭墝錛岀粺璁″畠浠殑寮犳暟錛岃涓篶nt銆傛槗鐭ワ紝鍓峣杞嚭榪囩殑i寮犵墝蹇呯劧閮芥槸榪欑鐗岋紝鍥犳鑻nt>i錛屼笖F[i + 1][j]鏄繀璐ョ姸鎬侊紝鍒欏彲浠ュ湪絎琲杞嚭涓寮犺繖鏍風殑鐗岋紝蹇呰儨銆?br />濡傛灉涓婇潰娌℃湁鍙戠幇涓涓彲浠ヤ嬌F[i][j]涓哄繀鑳滅姸鎬佺殑錛屽垯F[i][j]涓哄繀璐ョ姸鎬併?br />杈圭晫錛欶[i][511]涓哄繀鑳滅姸鎬?0<=i<=N錛夛紝F[N][j]涓哄繀璐ョ姸鎬侊紙0<=j<511錛屽洜涓虹N杞椂宸茬粡鏈ㄦ湁鐗屼簡錛夈?br />鏈鍚庯紝鑻[0][0]錛堝垵濮嬬姸鎬侊級涓哄繀鑳滅姸鎬佸垯鍏堟墜蹇呰儨錛屽惁鍒欏厛鎵嬪繀璐ャ?br />
]]>
Topcoder涓嶯OI鐨勮鍒欏尯鍒細
銆?銆慣opcoder鐨勪唬鐮佷笉鏄竴涓畬鏁寸殑浠ｇ爜錛堣繛main()閮界背鏈夛級錛岃屽彧鏄竴涓被錛岀被閲岄潰鍙湁涓涓柟娉曪紙鐩稿綋浜巑ain()錛夈備笉鐢ㄨ緭鍏ャ佽緭鍑猴紝緋葷粺浼氬皢杈撳叆鏁版嵁鐩存帴浼犻掑埌榪欎釜鏂規硶鐨勫弬鏁伴噷錛屽湪鏂規硶鎵ц瀹屽悗灝嗚繑鍥炲肩洿鎺ヤ紶閫掑埌杈撳嚭閲屻傜被鍚嶃佹柟娉曞悕銆佽緭鍏ュ弬鏁扮被鍨嬨佽緭鍑虹粨鏋滅被鍨嬫槸鍦ㄥ師棰樹腑瑙勫畾鐨勶紙浣嗗弬鏁板悕銆佽緭鍑虹粨鏋滃悕鍙互鑷畾涔夛級銆備唬鐮佷腑鍙互錛堜篃蹇呴』錛変嬌鐢–++ STL銆?br>銆?銆戞崏棰樼殑鏃跺欙紝棰樼洰鎻忚堪涓嬮潰鐨勭紪鐮佸尯閲屽彲浠ョ洿鎺ョ紪浠ｇ爜錛岀紪濂藉悗鐐逛笅闈㈢殑Compile緙栬瘧錛屽啀鐐筎est嫻嬭瘯錛堝彲浠ユ祴璇曟牱渚嬪拰鑷繁鐨勬暟鎹級錛屾祴璇曞畬姣曞悗錛岀偣Submit鎻愪氦銆傛墍浠ワ紝涓嶅繀鍚戝叾瀹僌J涓鏍峰湪IDE閲岀紪濂藉啀Ctrl+ACV鎻愪氦銆?br>鍏跺畠鐨勫彲浠ュ弬鐓х綉涓婂叾浠栦漢鍐欑殑涓滀笢銆?br>
鏈矙鑼跺厛鍦ㄩ噷闈㈡崏浜嗗嚑棰橈紙鍏ㄦ槸姘撮錛岀鐘囦笉瑕侀剻瑙嗭級錛屼唬鐮侊細
SRM 506 DIV1 250錛?br>
#include <iostream>
#include <string>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <time.h>
#include <iomanip>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
using namespace std;
#define re(i, n) for (int i=0; i<n; i++)
#define re1(i, n) for (int i=1; i<=n; i++)
#define re2(i, l, r) for (int i=l; i<r; i++)
#define re3(i, l, r) for (int i=l; i<=r; i++)
#define rre(i, n) for (int i=n-1; i>=0; i--)
#define rre1(i, n) for (int i=n; i>0; i--)
#define rre2(i, r, l) for (int i=r-1; i>=l; i--)
#define rre3(i, r, l) for (int i=r; i>=l; i--)
#define debug(x) cout << #x << " = " << x << endl;
#define pb push_back
#define re_t(i,x) for(typeof(x.begin()) i=x.begin();i!=x.end();i++)
#define all(x) x.begin(),x.end()
#define SORT(x) sort(all(x))
#define MP make_pair
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef vi::iterator vit;
typedef set<int> si;
typedef si::iterator sit;
typedef map<int,int> mii;
typedef mii::iterator mit;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int uint;
typedef istringstream ISS;
typedef ostringstream OSS;
const int MAXN = 175000, INF = ~0U >> 2;
class MathContest {
public:
int countBlack(string s0, int p)
{
string s = "";
bool a[MAXN];
re(i, p) s += s0;
int n = s.length(), res = 0;
re(i, n) a[i] = s[i] == 'B';
int i = 0, j = s.length() - 1;
bool reversed = 0, turned = 0, v;
while (i <= j) {
if (reversed) {
v = a[j--];
if (turned) v = !v;
} else {
v = a[i++];
if (turned) v = !v;
}
if (v) {res++; turned = !turned;} else reversed = !reversed;
}
return res;
}
};
SRM 506 DIV2 250錛?br>
#include <string>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <time.h>
#include <iomanip>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
using namespace std;
#define re(i, n) for (int i=0; i<n; i++)
#define re1(i, n) for (int i=1; i<=n; i++)
#define re2(i, l, r) for (int i=l; i<r; i++)
#define re3(i, l, r) for (int i=l; i<=r; i++)
#define rre(i, n) for (int i=n-1; i>=0; i--)
#define rre1(i, n) for (int i=n; i>0; i--)
#define rre2(i, r, l) for (int i=r-1; i>=l; i--)
#define rre3(i, r, l) for (int i=r; i>=l; i--)
#define debug(x) cout << #x << " = " << x << endl;
#define pb push_back
#define re_t(i,x) for(typeof(x.begin()) i=x.begin();i!=x.end();i++)
#define all(x) x.begin(),x.end()
#define SORT(x) sort(all(x))
#define MP make_pair
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef vi::iterator vit;
typedef set<int> si;
typedef si::iterator sit;
typedef map<int,int> mii;
typedef mii::iterator mit;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int uint;
typedef istringstream ISS;
typedef ostringstream OSS;
const int MAXN = 175000, INF = ~0U >> 2;
class MathContest {
public:
int countBlack(string s0, int p)
{
string s = "";
bool a[MAXN];
re(i, p) s += s0;
int n = s.length(), res = 0;
re(i, n) a[i] = s[i] == 'B';
int i = 0, j = s.length() - 1;
bool reversed = 0, turned = 0, v;
while (i <= j) {
if (reversed) {
v = a[j--];
if (turned) v = !v;
} else {
v = a[i++];
if (turned) v = !v;
}
if (v) {res++; turned = !turned;} else reversed = !reversed;
}
return res;
}
};
#include <iostream>
#include <string>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <time.h>
#include <iomanip>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
using namespace std;
#define re(i, n) for (int i=0; i<n; i++)
#define re1(i, n) for (int i=1; i<=n; i++)
#define re2(i, l, r) for (int i=l; i<r; i++)
#define re3(i, l, r) for (int i=l; i<=r; i++)
#define rre(i, n) for (int i=n-1; i>=0; i--)
#define rre1(i, n) for (int i=n; i>0; i--)
#define rre2(i, r, l) for (int i=r-1; i>=l; i--)
#define rre3(i, r, l) for (int i=r; i>=l; i--)
#define debug(x) cout << #x << " = " << x << endl;
#define pb push_back
#define re_t(i,x) for(typeof(x.begin()) i=x.begin();i!=x.end();i++)
#define all(x) x.begin(),x.end()
#define SORT(x) sort(all(x))
#define MP make_pair
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef vi::iterator vit;
typedef set<int> si;
typedef si::iterator sit;
typedef map<int,int> mii;
typedef mii::iterator mit;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int uint;
typedef istringstream ISS;
typedef ostringstream OSS;
const int MAXN = 10000, INF = ~0U >> 2;
class SlimeXSlimeRancher2 {
public:
int train(vector <int> a)
{
int n = a.size(), m = -INF, res = 0;
re(i, n) m = max(m, a[i]);
re(i, n) res += m - a[i];
return res;
}
};
SRM 506 DIV2 500錛?br>
#include <string>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <time.h>
#include <iomanip>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
using namespace std;
#define re(i, n) for (int i=0; i<n; i++)
#define re1(i, n) for (int i=1; i<=n; i++)
#define re2(i, l, r) for (int i=l; i<r; i++)
#define re3(i, l, r) for (int i=l; i<=r; i++)
#define rre(i, n) for (int i=n-1; i>=0; i--)
#define rre1(i, n) for (int i=n; i>0; i--)
#define rre2(i, r, l) for (int i=r-1; i>=l; i--)
#define rre3(i, r, l) for (int i=r; i>=l; i--)
#define debug(x) cout << #x << " = " << x << endl;
#define pb push_back
#define re_t(i,x) for(typeof(x.begin()) i=x.begin();i!=x.end();i++)
#define all(x) x.begin(),x.end()
#define SORT(x) sort(all(x))
#define MP make_pair
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef vi::iterator vit;
typedef set<int> si;
typedef si::iterator sit;
typedef map<int,int> mii;
typedef mii::iterator mit;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int uint;
typedef istringstream ISS;
typedef ostringstream OSS;
const int MAXN = 10000, INF = ~0U >> 2;
class SlimeXSlimeRancher2 {
public:
int train(vector <int> a)
{
int n = a.size(), m = -INF, res = 0;
re(i, n) m = max(m, a[i]);
re(i, n) res += m - a[i];
return res;
}
};
#include <iostream>
#include <string>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <time.h>
#include <iomanip>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
using namespace std;
#define re(i, n) for (int i=0; i<n; i++)
#define re1(i, n) for (int i=1; i<=n; i++)
#define re2(i, l, r) for (int i=l; i<r; i++)
#define re3(i, l, r) for (int i=l; i<=r; i++)
#define rre(i, n) for (int i=n-1; i>=0; i--)
#define rre1(i, n) for (int i=n; i>0; i--)
#define rre2(i, r, l) for (int i=r-1; i>=l; i--)
#define rre3(i, r, l) for (int i=r; i>=l; i--)
#define debug(x) cout << #x << " = " << x << endl;
#define pb push_back
#define re_t(i,x) for(typeof(x.begin()) i=x.begin();i!=x.end();i++)
#define all(x) x.begin(),x.end()
#define SORT(x) sort(all(x))
#define MP make_pair
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef vi::iterator vit;
typedef set<int> si;
typedef si::iterator sit;
typedef map<int,int> mii;
typedef mii::iterator mit;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int uint;
typedef istringstream ISS;
typedef ostringstream OSS;
const int MAXN = 10000, INF = ~0U >> 2;
class SlimeXSlimesCity {
public:
int merge(vector <int> a)
{
int n = a.size();
SORT(a);
ll s = 0, s1;
int res = 0;
bool ff;
re(i, n) {
s += a[i]; s1 = s; ff = 1;
re2(j, i + 1, n) {
if (s1 < a[j]) {ff = 0; break;}
s1 += a[j];
}
res += ff;
}
return res;
}
};
#include <string>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <time.h>
#include <iomanip>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
using namespace std;
#define re(i, n) for (int i=0; i<n; i++)
#define re1(i, n) for (int i=1; i<=n; i++)
#define re2(i, l, r) for (int i=l; i<r; i++)
#define re3(i, l, r) for (int i=l; i<=r; i++)
#define rre(i, n) for (int i=n-1; i>=0; i--)
#define rre1(i, n) for (int i=n; i>0; i--)
#define rre2(i, r, l) for (int i=r-1; i>=l; i--)
#define rre3(i, r, l) for (int i=r; i>=l; i--)
#define debug(x) cout << #x << " = " << x << endl;
#define pb push_back
#define re_t(i,x) for(typeof(x.begin()) i=x.begin();i!=x.end();i++)
#define all(x) x.begin(),x.end()
#define SORT(x) sort(all(x))
#define MP make_pair
typedef pair<int,int> ii;
typedef vector<int> vi;
typedef vi::iterator vit;
typedef set<int> si;
typedef si::iterator sit;
typedef map<int,int> mii;
typedef mii::iterator mit;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int uint;
typedef istringstream ISS;
typedef ostringstream OSS;
const int MAXN = 10000, INF = ~0U >> 2;
class SlimeXSlimesCity {
public:
int merge(vector <int> a)
{
int n = a.size();
SORT(a);
ll s = 0, s1;
int res = 0;
bool ff;
re(i, n) {
s += a[i]; s1 = s; ff = 1;
re2(j, i + 1, n) {
if (s1 < a[j]) {ff = 0; break;}
s1 += a[j];
}
res += ff;
}
return res;
}
};
]]>