瀛楃涓查暱搴﹀皬浜?00
鐩稿綋浜庡幓鎼滅儲1锝?00涓殑涓緇勪笉鍚岀殑鏁?br /> 鍔犺搗鏉ョ瓑浜庨暱搴
鍚屾椂姣忎釜鏁板瓧閮借灝忎簬絳変簬姣旇嚜宸卞皬鐨勬墍鏈夋暟鐨勫拰鍔犱竴
鍥犱負L姣旇緝灝?br /> 鎵浠ョ敤娣辨悳灝卞彲浠ヤ簡
鍦ㄨ繖涓繃紼嬩腑瑕佹敞鎰忔繁鎼滄椂鍊欓渶瑕佷粠澶у線灝忔悳
榪欐牱鎵嶈兘婊¤凍“鏈灝忕殑”緇撴灉
鎼滅儲瀹屼箣鍚庣殑瀛楃涓叉瀯寤虹殑姝ラ鍥犱負StringBuffer鐢ㄧ殑涓嶇啛緇?br /> 鍙嶈岃皟璇曚簡寰堜箙
1 import java.util.*;
2 import java.util.regex.*;
3 import java.text.*;
4 import java.math.*;
5 import java.awt.geom.*;
6
7 public class IdealString
8 {
9 int[] table = new int[26];
10 int finalindex = 0;
11 int L;
12
13 public String construct(int length)
14 {
15 Arrays.fill(table, 0);
16 L = length;
17 if(dfs(1, 0, 0)){
18 StringBuffer sb = new StringBuffer();
19 char c = 'A';
20 int i , j = 0;
21 for(i = 0 ; i < L; ++ i)
22 sb.append(' ');
23 for(i = 0 ; i < finalindex; ++i){
24 sb.setCharAt(table[i] - 1, c ++);
25 table[i]--;
26 }
27 for(i = 0 ; i < L; ++ i){
28 if(sb.charAt(i) != ' ')
29 continue;
30 while(table[j] == 0) j++;
31 sb.setCharAt(i, (char)('A' + j));
32 table[j]--;
33 }
34 return sb.toString();
35 }
36 return new String();
37 }
38
39 boolean dfs(int num, int index, int sum){
40 table[index] = num;
41 int base = num + sum;
42 if(base == L){
43 table[index] = num;
44 finalindex = index + 1;
45 return true;
46 }
47 if(base > L)
48 return false;
49 int total = 0;
50 for(int i = 0 ; i <= index ; ++ i)
51 total += table[i];
52 for(int i = total + 1; i >= num + 1; -- i){
53 if(base + i <= L && dfs(i, index +1, base))
54 return true;
55 }
56 return false;
57 }
58 }
2 import java.util.regex.*;
3 import java.text.*;
4 import java.math.*;
5 import java.awt.geom.*;
6
7 public class IdealString
8 {
9 int[] table = new int[26];
10 int finalindex = 0;
11 int L;
12
13 public String construct(int length)
14 {
15 Arrays.fill(table, 0);
16 L = length;
17 if(dfs(1, 0, 0)){
18 StringBuffer sb = new StringBuffer();
19 char c = 'A';
20 int i , j = 0;
21 for(i = 0 ; i < L; ++ i)
22 sb.append(' ');
23 for(i = 0 ; i < finalindex; ++i){
24 sb.setCharAt(table[i] - 1, c ++);
25 table[i]--;
26 }
27 for(i = 0 ; i < L; ++ i){
28 if(sb.charAt(i) != ' ')
29 continue;
30 while(table[j] == 0) j++;
31 sb.setCharAt(i, (char)('A' + j));
32 table[j]--;
33 }
34 return sb.toString();
35 }
36 return new String();
37 }
38
39 boolean dfs(int num, int index, int sum){
40 table[index] = num;
41 int base = num + sum;
42 if(base == L){
43 table[index] = num;
44 finalindex = index + 1;
45 return true;
46 }
47 if(base > L)
48 return false;
49 int total = 0;
50 for(int i = 0 ; i <= index ; ++ i)
51 total += table[i];
52 for(int i = total + 1; i >= num + 1; -- i){
53 if(base + i <= L && dfs(i, index +1, base))
54 return true;
55 }
56 return false;
57 }
58 }
]]>
]]>
緇欏嚭n縐嶅晢鍝佷笉鍚岄【瀹㈢殑璐拱閫夋嫨錛岃綆楁墦鍖呯粍鍚堢殑鍟嗗搧錛屽嵆鎵鏈夐【瀹㈣涔堥兘涔拌涔堥兘涓嶄拱鐨勭粍鍚堬紝榪斿洖鏈灝忕殑鎵撳寘鏁般?br />
鏈鐩存帴鐨勬兂娉曞氨鏄亶鍘嗕竴杈癸紝姣忎釜欏懼鐨勬暟鎹垎鎴愪笉鏂褰撳墠鐨勫悇涓寘鍙栦氦鍜屽彇鍑忓垎涓烘洿灝忕殑鍖?br /> 鍙槸榪欐牱鐨勫鏉傚害楂樿揪2鐨凬嬈℃柟錛屼互妗堜緥鐨勬暟鎹噺50鏉ョ湅涓瀹氭槸瓚呮椂鐨?br /> 絳旀鏄皢杈撳叆浠庝笉鍚岄【瀹㈢殑浜у搧閫夋嫨杞寲鎴愪負涓嶅悓浜у搧鐨勮喘涔伴【瀹?br /> 緇撴灉鏄洿鎺ユ瘮杈冧袱縐嶄駭鍝佺殑灝卞彲浠ョ煡閬撴槸鍚﹀彲浠ュ湪鍚屼竴涓寘涓?br /> 澶уぇ闄嶄綆鐨勫鏉傚害
鍙鑳界浉閫氳繖涓鐐?br /> 鍚庨潰鐨勪唬鐮佹槸闈炲父瀹規槗鐨?
]]>
緇欏嚭涓涓暟n錛岃繑鍥炰互n寮澶寸殑鍙互琚玭鐨勬瘡涓浣嶉潪闆舵暟瀛楁暣闄ょ殑鏁般?br />
棰樼洰鏈韓鏆村姏璁＄畻娌￠毦搴?br /> 緇堢偣鍦ㄤ簬瀵規湁瑙ｆф垨鑰呰В鐨勪及璁?br /> 鐢變簬1锝?鐨勬渶灝忓叕鍊嶆暟鏄?520
鎵浠ュ湪n0000鍒皀2519涓竴瀹氭湁涓涓暟鍙互鏁撮櫎鍏舵墍鏈変綅
鏈澶氳綆楁鏁頒篃灝辨槸1錛?0錛?00錛?000錛?520
]]>
N涓濺绔欙紝鑻ュ共杈嗚濺錛屾瘡杈嗚濺鏈夊鍙戙佺粓鐐廣佸紑杞︽椂闂淬佽繍琛屾椂闂村拰紲ㄤ環5涓弬鏁幫紝姹備粠絎竴绔欏埌鏈鍚庝竴绔欏湪T鏃墮棿鍐呮渶渚垮疁鐨勪箻杞︽柟妗堛?br />
鍒濈湅鏄緢綆鍗曠殑DP錛屽彧瑕佺敤鏁扮粍浠庣涓琛屽悜鍚庨愯璁＄畻鍗沖彲
鍙槸鍚庢潵鐪嬩簡嫻嬭瘯鏁版嵁鍙戠幇浜嗛嗚杞?br /> 鎵浠ュ湪璁＄畻欏哄簭涓婂姞浜嗛槦鍒?鐩稿綋浜庢槸涓涓鎼?br />
瑙ｅ喅鏃跺欎富瑕佺殑闂鍑哄湪浜咲P鏁扮粍鐨勫畾涔変笂
涓寮濮嬬殑鎬濊礬鏄敤杞︾珯鍜岃濺鍘誨紑浜岀淮鏁扮粍
榪欐牱鐨勮瘽姣忎釜鍊煎張瑕佺敤鏃墮棿鍜屼環鏍間袱涓弬鏁板幓璁板綍
璁＄畻榪囩▼涔熼潪甯稿鏉?br /> 鍚庢潵緇忚繃鎻愮ず鏀規垚鐢ㄨ濺绔欏拰鏃墮棿鍘昏褰曚環鏍?br /> 灝辨柟渚垮浜?br />
1
import java.util.*;
2import java.util.regex.*;
3import java.text.*;
4import java.math.*;
5import java.awt.geom.*;
6
7public class OnTime
8
{
9
//the queue has to record two dimensions
10
public class pair{
11 int n;
12 int t;
13 public pair(int n, int t){
14 this.n = n;
15 this.t = t;
16
}
17 }
18
19 public int minCost(int N, int T, String[] buses)
20 {
21 int L = buses.length;
22 int[] a = new int[L];
23 int[] b = new int[L];
24 int[] depart = new int[L];
25 int[] time = new int[L];
26 int[] cost = new int[L];
27
28 //data parse
29 int i;
30 for(i = 0; i < L; ++i){
31 String temps = buses[i];
32 String[] ints = temps.split(" ");
33 a[i] = Integer.parseInt(ints[0]);
34 b[i] = Integer.parseInt(ints[1]);
35 depart[i] = Integer.parseInt(ints[2]);
36 time[i] = Integer.parseInt(ints[3]);
37 cost[i] = Integer.parseInt(ints[4]);
38 }
39
40 int[][] table = new int[N][T+1];
41 for(int[] ta : table)
42 Arrays.fill(ta, Integer.MAX_VALUE);
43 table[0][0] = 0;
44
45 //first station is special
46 Queue<pair> q = new LinkedList<pair>();
47 for(i = 0 ; i < L; ++ i){
48 if(a[i] == 0 && depart[i] >= 0 && depart[i]+time[i] <= T){
49 table[b[i]][depart[i]+time[i]] = table[0][0] + cost[i];
50 q.add(new pair(b[i],depart[i]+time[i]));
51 }
52 }
53
54 //bfs search
55 while(!q.isEmpty()){
56 pair out = q.poll();
57 for(i = 0; i < L; ++ i){
58 if(a[i] == out.n && depart[i] > out.t && depart[i] + time[i] <=T &&
59 cost[i] + table[out.n][out.t] < table[b[i]][depart[i]+time[i]]){
60 table[b[i]][depart[i]+time[i]] = table[out.n][out.t] + cost[i];
61 q.add(new pair(b[i],depart[i]+time[i]));
62 }
63 }
64 }
65
66
67 //find min
68 int min = table[N-1][0];
69 for(i = 1 ; i <= T ; ++ i){
70 if(table[N-1][i] < min)
71 min = table[N-1][i];
72 }
73
74
75 return (min==Integer.MAX_VALUE?-1:min);
76
77 }
78
}
import java.util.*;2
import java.util.regex.*;3
import java.text.*;4
import java.math.*;5
import java.awt.geom.*;6
7
public class OnTime8
{
9
//the queue has to record two dimensions 10
public class pair{
11
int n;12
int t;13
public pair(int n, int t){14
this.n = n;15
this.t = t;16
}17
}18
19
public int minCost(int N, int T, String[] buses)20
{21
int L = buses.length;22
int[] a = new int[L];23
int[] b = new int[L];24
int[] depart = new int[L];25
int[] time = new int[L];26
int[] cost = new int[L];27
28
//data parse29
int i;30
for(i = 0; i < L; ++i){31
String temps = buses[i];32
String[] ints = temps.split(" ");33
a[i] = Integer.parseInt(ints[0]);34
b[i] = Integer.parseInt(ints[1]);35
depart[i] = Integer.parseInt(ints[2]);36
time[i] = Integer.parseInt(ints[3]);37
cost[i] = Integer.parseInt(ints[4]);38
}39
40
int[][] table = new int[N][T+1];41
for(int[] ta : table)42
Arrays.fill(ta, Integer.MAX_VALUE);43
table[0][0] = 0;44
45
//first station is special46
Queue<pair> q = new LinkedList<pair>();47
for(i = 0 ; i < L; ++ i){48
if(a[i] == 0 && depart[i] >= 0 && depart[i]+time[i] <= T){49
table[b[i]][depart[i]+time[i]] = table[0][0] + cost[i];50
q.add(new pair(b[i],depart[i]+time[i]));51
}52
}53
54
//bfs search55
while(!q.isEmpty()){56
pair out = q.poll();57
for(i = 0; i < L; ++ i){58
if(a[i] == out.n && depart[i] > out.t && depart[i] + time[i] <=T &&59
cost[i] + table[out.n][out.t] < table[b[i]][depart[i]+time[i]]){60
table[b[i]][depart[i]+time[i]] = table[out.n][out.t] + cost[i];61
q.add(new pair(b[i],depart[i]+time[i]));62
}63
}64
}65
66
67
//find min 68
int min = table[N-1][0];69
for(i = 1 ; i <= T ; ++ i){70
if(table[N-1][i] < min)71
min = table[N-1][i];72
}73
74
75
return (min==Integer.MAX_VALUE?-1:min);76
77
}78
}]]>
涓や釜鏁存暟n鍜宒, 1<=n<=10, 1<=d<=n,姹備竴涓猲*n鏂歸樀錛屾瘡涓琛屾瘡涓鍒楅兘瀛樺湪0锝瀌鐨勬瘡涓暟錛屽鏋滄湁澶氫釜鐭╅樀錛岃繑鍥炲瓧姣嶅簭鏈灝忕殑涓涓?br />
浠庡ご閫掑綊鎼滅儲錛屽姣忎釜浣嶇疆浠庡皬閬嶅巻鎵鏈夊鹼紝閽堝姣忎釜鍊煎仛濡備笅鎿嶄綔錛?br /> 1.璧嬪間負0
2.媯鏌ヨ琛屽墿涓嬬殑浣嶇疆鏄惁瓚沖鏀句笅榪樻病鏈夊嚭鐜扮殑鎵鏈夌殑鏁幫紝鑻ュ惁榪斿洖絎竴姝ュ茍涓旓紜錛嬶紱
3.媯鏌ヨ鍒楀墿涓嬬殑浣嶇疆鏄惁瓚沖鏀句笅榪樻病鏈夊嚭鐜扮殑鎵鏈夌殑鏁幫紝鑻ュ惁榪斿洖絎竴姝ュ茍涓旓紜錛嬶紱
4.鐜板湪鏄竴涓彲浠ヨ冭檻鐨勫鹼紝棣栧厛鏄粓緇撳鹼紝鑻ヨ浣嶇疆宸茬粡鏄煩闃靛彸涓嬭錛屽垯榪斿洖true錛岃繖鏄敮涓榪斿洖true鐨勮搗鐐?br /> 5.鍚戝悗閫掑綊璋冪敤鍑芥暟錛岃皟鐢ㄤ笅涓涓綅緗?br /> 6.濡傛灉榪斿洖鍊間負true錛屽垯榪斿洖true錛屽惁鍒欑戶緇?br /> 7.榪斿洖false
鎬葷殑鏉ヨ錛岄掑綊鐨勯『搴忥紝1鏄亶鍘嗘墍鏈夊彲鑳藉鹼紝2錛?鏄帓闄ゅ拰鍓灊錛?鏄嫻嬫垚鍔熸潯浠訛紝5鏄掑綊璋冪敤錛?錛?鏄掑綊鐨勭粨鏋?br /> 綆楁硶鐨勫鏉傚害杈冮珮錛岋紙15錛?5錛夊氨宸茬粡綆椾笉鍑轟簡錛岃屼笖榪樹笉鐭ラ亾璇ユ庝箞璁＄畻鏃墮棿澶嶆潅搴︼紝榪欐牱鐨勯掑綊搴旇澶嶆潅搴︽槸寰堥珮鐨?br /> 鍙槸閫氳繃鍓灊搴旇浼樺寲浜嗗緢澶氾紝涓嶈繃涓嶇煡閬撹綆楀鏉傚害鏃朵警瑕佹庝箞鑰冭檻銆?br />
寰堝ぇ紼嬪害涓婅繕鏄牴鎹彁紺哄啓瀹岀殑錛屼唬鐮佽兘鍔涘お寮卞暒錛?br />
1
import java.util.*;
2import java.util.regex.*;
3import java.text.*;
4import java.math.*;
5import java.awt.geom.*;
6
7public class QuasiLatinSquares
8
{
9
int[][] ans;
10 int n;
11 int d;
12
13 public String[] makeSquare(int n, int d)
14
{
15
16 this.n = n;
17 this.d = d;
18 ans = new int[n][n];
19 backtrace(0,0);
20
21 //change the integer matrix to string array
22 String[] ret = new String[n];
23 for(int i = 0; i < n ; ++ i){
24 StringBuilder sb = new StringBuilder();
25 sb.append(ans[i][0]);
26 for(int j = 1; j < n ; ++ j){
27 sb.append(" ");
28 sb.append(ans[i][j]);
29
}
30 ret[i] = sb.toString();
31 }
32 return ret;
33 }
34
35 public boolean backtrace(int i, int j){
36 //have to check every value here
37 for(int v = 0; v < d; ++ v){
38 ans[i][j] = v;
39
40 //check whether still enough place for numbers that haven't appear
41 boolean[] row = new boolean[d];
42 boolean[] col = new boolean[d];
43 Arrays.fill(row, false);
44 Arrays.fill(col, false);
45 for(int rowidx = 0; rowidx <= i; ++ rowidx)
46 row[ans[rowidx][j]] = true;
47 for(int colidx = 0; colidx <= j; ++ colidx)
48 col[ans[i][colidx]] = true;
49 int rct = 0, cct = 0;
50 for(boolean b:row){
51 if(b == false) rct++;
52 }
53 for(boolean b:col){
54 if(b == false) cct++;
55 }
56 if(rct > n-1-i)
57 continue;
58 if(cct > n-1-j)
59 continue;
60
61 //if it's the last place, success!
62 if((i == n-1) && (j == n-1))
63 return true;
64
65 //recursively calculate latter numbers based on this value
66 boolean next;
67 if(j != n-1)
68 next = backtrace(i,j+1);
69 else
70 next = backtrace(i+1,0);
71 //if it has reached the end,it means this value has led to success, else it means the value has to increase
72 if(next == true)
73 return true;
74
75 }
76 //have checked every number but none matches, former numbers has to reconsider
77 return false;
78 }
79
}
import java.util.*;2
import java.util.regex.*;3
import java.text.*;4
import java.math.*;5
import java.awt.geom.*;6
7
public class QuasiLatinSquares8
{
9
int[][] ans;10
int n;11
int d;12
13
public String[] makeSquare(int n, int d)14
{
15
16
this.n = n;17
this.d = d;18
ans = new int[n][n];19
backtrace(0,0);20
21
//change the integer matrix to string array22
String[] ret = new String[n];23
for(int i = 0; i < n ; ++ i){24
StringBuilder sb = new StringBuilder();25
sb.append(ans[i][0]);26
for(int j = 1; j < n ; ++ j){27
sb.append(" ");28
sb.append(ans[i][j]);29
}30
ret[i] = sb.toString();31
}32
return ret;33
}34
35
public boolean backtrace(int i, int j){36
//have to check every value here37
for(int v = 0; v < d; ++ v){38
ans[i][j] = v;39
40
//check whether still enough place for numbers that haven't appear41
boolean[] row = new boolean[d];42
boolean[] col = new boolean[d];43
Arrays.fill(row, false);44
Arrays.fill(col, false);45
for(int rowidx = 0; rowidx <= i; ++ rowidx)46
row[ans[rowidx][j]] = true;47
for(int colidx = 0; colidx <= j; ++ colidx)48
col[ans[i][colidx]] = true;49
int rct = 0, cct = 0;50
for(boolean b:row){51
if(b == false) rct++;52
}53
for(boolean b:col){54
if(b == false) cct++;55
}56
if(rct > n-1-i)57
continue;58
if(cct > n-1-j)59
continue;60
61
//if it's the last place, success!62
if((i == n-1) && (j == n-1))63
return true;64
65
//recursively calculate latter numbers based on this value66
boolean next;67
if(j != n-1)68
next = backtrace(i,j+1);69
else70
next = backtrace(i+1,0);71
//if it has reached the end,it means this value has led to success, else it means the value has to increase72
if(next == true)73
return true;74
75
}76
//have checked every number but none matches, former numbers has to reconsider77
return false;78
}79
}]]>