From a8850814620671b947c914a49f72586cbe0a9321 Mon Sep 17 00:00:00 2001
From: ArunRaja <arunraja101@gmail.com>
Date: Thu, 7 Jun 2012 13:47:39 +0530
Subject: [PATCH] DynamicProgramming Level1 added

---
 bin/Topcoder.class | Bin 1856 -> 3715 bytes
 src/Topcoder.java  | 156 +++++++++++++++++++++++++++++++++------------
 2 files changed, 116 insertions(+), 40 deletions(-)

diff --git a/bin/Topcoder.class b/bin/Topcoder.class
index a98fd3b1db16b69e0a287a418acb05620e5a28c2..5fd1cf535abdf1ac0ff39cc1ab182beb92d5fb88 100644
GIT binary patch
literal 3715
zcmZu!U2v1f6+Nr(S3)+D%x7aPfdeVAEn}AeBG}kYaGb`$Ac9>J#idx5WDw}b$PzJW
zN|G5fZJOy!o;nGWDK<&RGaWiZGK^`H)RWiJ|MoSV_NjkQed$AILe#VS*)m|vcz3_u
zy?5_9_v~GB_p47<06d8|EO-R$vEodsn9h_e=mLTB$xF%ZT(WSsJ3e(jlPU|ChqHxj
zxnDqQYabWT2f5h?4PHMCm;#$evW3j?N`5L+8cR;)G6JEIVk(&%PnNRsdv#JTpUch)
z_(s;w>!q)JGFuR6Y?~NaKX<fT$`;P{wvYQD;PoPeEfyLc2yOK8Y&nzn!$Bj%DpnY!
z<9f&zyHC)(OedLSzE`@~>PIuS5okU+H&!VX7=+O_G2A}vLm1mFL<Abt=?~iau>-9F
z){JzQW0ZQ^u*5HD-|&cd1w7>xqnWB)7HDo8mOt$qVcB?sp`3`1jt(Cg8M4t%N`{ZE
zeKRzkmm-H^m=34*%H~Pg?32xY&QEbL!9|hfVY8JyN9P6VM$5_6g=5JX#kK_+n#}2F
z<{}{w?Qr`9@e1_#aS%_@Cdprd@)j!ju~H><L9xPZYS+_#^nn?dtAnLvIm1;uS4^fy
zv#&BXJD)8)D{ZvbtJSLZ2GzvC)2<hdi;Rq9b8fbnyClJkahxw+l74(=Gv#AcR9=SO
z)V7f!H;6c1v~c3VtSe#oaT22fo65z(bIH;(rBaf7>uv25gHm`KWW<AugT+}Y#F%q?
zJw+o)A`SGES`s-6FL6h?L_J#gHUoRu(UD3vM?!5(l39Xl-P7vBX-vsWz_dG$03sE9
z8W}&Pah68OnVC!>EfA)THpIE=o`OA%tRLrbfi#zk?p+Yr(zelrd&A%**dfpNCCg-I
zs-jZmOJ}F2Go?&H3Q3>N%2TbjVQOBAU=|e%<iow{m2x)MtyrA(;}Tw>!ECW4>5_MZ
zdiR$y7c1FPCOwwT)15^S$y}M7n=?h;45^IF+{~G>S~XJ1Qkqjn*}Z7K(PE{P$~>2q
zWub2E=66YQ@fby;Q98gTDIb_@Eq-;g7wnCWJFq|Ezylv!xy(s!2K=jIKkE49MLjli
zMjC&?eIE7;pF$+=ATaVVg3&<ZXTF3MI2cdpf&KA>5$KC2%piUfPgp_xKAx}xv3Me2
z1`f03%w2YN;1FAHpogt5aDeTmApXS8AK1sXF3`)iK8QcE+Z@Di*#(051G``lzhV~(
z;&<#Cg7`DLEkXR6ofCK}zKo`2w5;Q*S0wmgBZ%v0Q1}{M45Vl$vDkPQyNFcM@;JWc
zA{8yr6)y=(f(sK{gwPzF&>SP)V`?#L2?w;8t;M`c*ydQe<DI+m9_k#s*>t>JlQDbV
zD;%%2SpB<Ww=BR6?Y=c{3C9Wq7OQtdZMS%|rjF=P?KU)_1rh#h#dhpw`*nub!|@=4
z8sXYFo>1XWyMZxHGCe>79f&e)IqKv{CMbbD9LfAA(8ZCiM%^44Jm&~~?`0~t;V>Vn
zC{x=?%Y7W#q@or3Ir8EFZMML?hlqukxCdK^2G9RcFa5L1xkTYMJsNT*x}v8)^BoUg
zgAu)@#q=dOdmKIL==x+A+pctcUKgC;w#Di{JNAV2^fC^u)39ABtdngQVRjSTUgm2b
zN!ZJo0}A?n_oy25gXra|gnp1vBy@|=BsdKLQYXRb3P>HaFHuJzU&0VUny><|BADkE
z$y8@c_yZXF%@$+k8tRRX79$s4#=yCoYa`j~lX7nICilD9Yg8fiu<hmH{S12mTk(tv
zx7GDq3%8T=Zl*e!0~xO5Sck_7upeYT+-vq<+S!~L2tC^u8tRWGdaRWgC1)&QN3-P^
zT`}F!!#7|$dY_|5K9qz0c|$mcV=h+z79q9i=t_D$$eqgF3rzV@9&(H+KF&m+Ks#P!
z;*TPRvHSQPs0BQL=M=vh+5LtJ*u)_`&yhwyAwpi`_XzYV(`8!_QZ2kpvInZH9koeO
zo3z&_*LF%-4c91mi?m45?$Y|Seo84Ejjlw}db%qb=}J%b&1)hOT`_Wt)qjQ8VY<0^
znY>Og7pKw4{xO_U&^laqHE6r=f`aDZj-v{i&bucCqp7Ue@Z5tXs1@+`9dk1y{!K43
zGq<A4INqZ(CC$1@4XeRx&AMal4-70|H%F#pF<kZ8<QPUcasyU)33}w*q|D>U>gMYR
zJ-B&?Lzgw{xdm7eT7{KSlQLRgz7E54Qxz4*lw7>&nEDlc0U_tU^JwW9>m2p4oC6t3
zVVZaREWfh6<ri2l@>FLLFXJK~s#$y=W&D6^Kf){cF)rh0_>SW7q>I1C<1O+xMs~;v
zzNvVWqjANfiJ#&WULt2+EU^;F>Qj#!JR{2UgSfg{edH~82X$2j;%X%>g)%|8NC7>*
zVbUW+l_n4G)o5UD9ed;&O^gOlm1WdY5?woi>XWV>n&fUN$8Xi-_zz-`Rqj-1h<a4j
ztw|QO@Q3ipUZ$vTwZ5^s@mc&7rxT$wcaUVgV4*v=jGQvt90{vxIN4v@{-4NtdUlg4
zV4jCvCEefS-ym1{7`(;%_clw$4=L5RN%K1@75yZUA=OfG3We3%I;QTZhh9!HrBc#%
ztr`ySTCCT_dYE5f6N#&TT4+1v>pw#QxMk?C1TA0vq0XP9q)=1uTFhL+PRHnU%&y6n
z53pr*7&9V{p+L=>!ZABn7OQ_T<l8CVOg^3u7y5VU{2D`lpJil$H}3|E{QG=Wexjf~
z?;c!(HpJWNR?Z>J5u}IE2dGL3%}a7#<w)o5LsY3$*=CkD3DQ(|xe;2G$H*kR)kzAg
zMP``)by)@bIqhY^8Hh@-GRZ7EJ6UbsgE{XJ9O#qL2;Z^=cxA7}-5MlcvoC7f?kh&}
z6$3t^(~rsiZ9WXkERc7|{x4X2KVg8k`OyB7Py7lWqtDfDw@BSze_vA>l~wn<gyW&7
ZgZCAwO)&1EP6#{X2@uB>9_YdA{|8~}X<`5X

literal 1856
zcmZuxUvm>x96dML&1RRRq$yi%5^4n0G%YO@Xt70<)}qmrR8u>X=}R}sLbpw_akD}2
z!KZ!+d7|S3FMUAADKo<0J0HaHD>wt<xtsJ4gPF;_zx(f;^E>x<_r<?|JO?n1vWAdA
zbk%Lw+`8>)Py`ZN)?I6=VYTi|m8x5I%@>GVb6SpnT_BtrTN6+gx!FJ%dJHNe0w;@3
z%f8iZR&8(9sy1waWYMizjWx@2<hVbn_?u2gz$hN@%@eC>IW2+V+<Nhdx9odP>(2bx
zngIb_Hpv)<B-21`)2?kVZd%^5<<~X^1ObQs=d3`;uTgNddtYEASCGH4w<)4XG5?iP
zxm;K%E=7@{yu$LqSU_!iPL2790s*TRWiu_COR~Al`6`2TE((Waoo<uSmO#AhTea<F
zs~u#n;T%1rzh(P-0WG&qDeDE9*7+Fn80Q&_f7+n8y3JLuTia$<Dn*Y4yDr6W0pyme
zi=O4%T#Ytdt6p|~q&Drg)2c69_axxe7(T|Fz+mSGlDjKzr{nMfxJs*YeY|Ti%t$=3
zt>IJN-jVT3p67Z|+z?p$uI1Ssw{h35XKQY=?KCXkaa-B8=Mt|umo@ZGwq~_juAi;i
z*~7iQo3*lc`}b}bxQ<0xB%ceIxwq{fThnn9UuyW`jk+t}@A!5zh628#t8SMiX!Z^}
z?$iov!)JxqR&(A!5w|ofvj&1B-dv8MgcbV3J8bz4+AAGk{TgMr>(%U=j;z%9K`~BB
z1iViZ!+aY+lo6|&t;W$5d%<4KKSA_Y1|b-1<+6-Vu#NRLu#a=3V*n>PBM%q2Bg8)b
z6r%D3iQ@P^29H1n0!EFDIu9EG*l_OvPQm2CD3uHoR%&<$@AhCt8cHCdqCGPz;Y_Kb
zoGw*VQz=y<rdpbdglDuzxDuX;hG+CgNST^q>i2&78F4c@5;673jhX0<E=*n9ef^gi
zO+Q2=Ir4Z%6Q-6(?7n`HOg|=dIH1S}?I6jMI89Mm%KDI_3mCy1<3(h66-lgNG?0J0
zC#>%UP~oXj%9hc4jHDYCqKpQqS7`evlaX_07^y^Fz*(H5zbRb92b|NmdxD&!G~+De
zj~MC5@ysbiUg5NcG4TpfA%;T#U_j#YW%Z20??hBNGduoVsXsGrWgb8se;l4s9>F|s
zD&wZ2Y)rD9te18a!3l2Lef@X-d`7A7W8%mLDFdX}DCq>n#3^8iL}%DfQl2b>%RQ>Y
z)MvSJE=YZrRU}i_Xq!wfj0DFrIVDIWj_^ywnaE41VvtAp>iZe&aEmO<iFD={sLEbi
zZ9l+(nop~Z%s!?!_YNZ2D;sidV~_iLw>KO}y2$nt$!971DvM|?kelt{9?G3y0==7>
zz?DF*^jJYiOHd2H8+}DveMKp0W_m9jdI&YNm(Qp7F&o%6f5hJ_@Eg3%1#&MP<4qm%
zrUG+hg{1Jwao$LTbNs0Fc`sA1yj|ldu2+(uJ;B1C936j+?Et^`8jU_aKM;pcd6v5+
ikNz8$64U$m`sgJZ0kqE&>mCD<uTnl~fo}q;Z~p_&b0;eR

diff --git a/src/Topcoder.java b/src/Topcoder.java
index e8c5a4e..fba4f4c 100644
--- a/src/Topcoder.java
+++ b/src/Topcoder.java
@@ -1,3 +1,6 @@
+import java.util.Arrays;
+import java.util.HashSet;
+
 
 public class Topcoder {
 	
@@ -6,7 +9,13 @@ public static void main(String[] s)
 	{
 		Topcoder tc = new Topcoder();
 		//System.out.println("Will all but 1st params add to 1st param-"+tc.buy(10,2,41,2,2));
-		tc.checkCharMatch();
+		//tc.checkCharMatch();
+		//System.out.println(tc.minDucks(new int[]{9,3,6,4}));
+		//System.out.println(tc.getMinimum("o??x",9,4));
+		//System.out.println(tc.train(new int[]{5,5}));
+		//System.out.println(Arrays.toString(tc.find(100000,new int[]{100000})));
+		System.out.println(tc.maxTurns(new int[]	{55, 52, 61, 204, 207, 54, 60, 202, 57, 58, 53, 210, 51, 59, 209, 205, 208, 201, 206, 211, 203, 56}));
+		
 	}
 	
 	// recursion
@@ -20,7 +29,7 @@ public String buy(int price, int b1, int b2, int b3, int b4)
 			int sum=0;
 			for(int j=0;j<4;j++)
 			{
-				if((i & (1<<j))!=0) // determine add list based on true bits 
+				if((i & (1<<j))!=0) // determine add value of array based on true bits of i index
 				{
 					sum += b[j];
 				}
@@ -47,9 +56,7 @@ int[] derSeq(int[] a,int n)
 	public int numTrucks(int numCrates, int loadSize)
 	{
 		if (numCrates <= loadSize)
-		{
 			return 1;
-		}
 		else
 		{
 			if(numCrates % 2 == 0)
@@ -59,61 +66,130 @@ public int numTrucks(int numCrates, int loadSize)
 		}
 	}
 	
-	// return max of n after k swaps of elements
-	public int findMax(int n,int k)
+	//Greedy L1 problems
+	
+	// pronounce numbers from A to B sequentially - Find: minimal numbers missed  
+	int minDucks(int[] ducks)
 	{
-		if(k==0) return n;
-		else if (n==-1) return -1;
-		else
+		int min=Integer.MAX_VALUE,max=Integer.MIN_VALUE;
+		for(int a : ducks)
 		{
-			return findMax	(swapToPossibleMax(n),k-1);
+			if(a<min)
+				min = a;
+			
+			if(a>max)
+				max = a;
 		}
+		
+		return (max - (min-1)) - ducks.length;   //http://community.topcoder.com/stat?c=problem_statement&pm=11631
 	}
 	
-	int swapToPossibleMax(int n)
+	// Sorted Array Create from unsorted array by moving one value at a time - Find : Number of moves required on optimal solution for Worst case
+	int solve(int[] T)
 	{
-		char[] c =  Integer.toString(n).toCharArray();
-		int m_idx = -1;
-		char max=0;
-		
-		if(c.length==1)
-			return -1;
+		int moves = 0;
+		for(int i=0;i<(T.length/2);i++)  // note: half the array comparison is enough
+		{
+			moves += T[T.length-i-1] - T[i];
+		}
+		return moves;   // http://community.topcoder.com/stat?c=problem_statement&pm=11336
+	}
+	
+	// Fill '?' in string with 'o' or 'x' to make palindrome with minCost
+	int getMinimum(String s, int oCost, int xCost)
+	{
+		char[] cArr = s.toCharArray();  
+		int cost = 0; 
+		int l = cArr.length;
 		
-		//choosing the max elem other than first one
-		for(int i=1;i<c.length;i++)
+		for(int i=0;i<l/2;i++)
 		{
-			if(c[i]>max)
+			if (cArr[i] == '?' && cArr[l-i-1]=='?')
 			{
-				max = c[i];
-			  	m_idx = i;
+				cost += 2* ((oCost<xCost)?oCost:xCost);
 			}
+			else if(cArr[i] == '?' || cArr[l-i-1]=='?' )
+			{
+				cost += cArr[l-i-1]=='x'?xCost:oCost;
+			}
+			else if(cArr[i] != cArr[l-i-1])
+				return -1;
 		}
 		
-		if(max > c[0])
+		if((l&1)==1) 
 		{
-			
-			// swap 1 st and max elem
-			char tc = c[0];
-			c[0] = c[m_idx];
-			c[m_idx] = tc;
-			
+			cost += (oCost<xCost)?oCost:xCost;
+		}
+		return cost;  //http://community.topcoder.com/stat?c=problem_statement&pm=11727
+	}
+	
+	// Swap elements of the string such that  - http://apps.topcoder.com/wiki/display/tc/SRM+521  http://community.topcoder.com/stat?c=problem_statement&pm=11567
+	
+	
+	// increase elems to common value
+	int train(int[] attributes)
+	{
+		int max = Integer.MIN_VALUE , difference = 0;
+		for(int i=0;i<attributes.length;i++)
+		{	
+			max = attributes[i]>max ? attributes[i] : max;
 		}
-		else 
+		System.out.println("max - "+max);
+		
+		for(int i=0;i<attributes.length;i++)
 		{
-			// swap final 2 elems
-			char tc = c[c.length-2];
-			c[c.length-2] = c[c.length-1];
-			c[c.length-1] = tc;
+			difference += max - attributes[i];
 		}
 		
-		if( c[0]==0)
-			return -1;
+		return difference;  //http://community.topcoder.com/stat?c=problem_statement&pm=11279
+	}
+	
+	// Easy http://community.topcoder.com/stat?c=problem_statement&pm=11151
+	
+	// TheProgrammingContestDivTwo TotalProbTime T - requiredTime - T1,T2.. compute penalty(total time spent) & points (number of probs solved)
+	int[] find(int T, int[] requiredTime)
+	{
+		Arrays.sort(requiredTime);   // Optimization to pick smallest ones first
+		
+		int penalty = 0, points = 0, exp_time = 0;
 		
-		return Integer.parseInt(s);
+		for(int i=0;i<requiredTime.length;i++)
+		{
+			//rem_time -= requiredTime[i];
+			
+			if ((exp_time +requiredTime[i])<=T)
+			{
+				exp_time +=requiredTime[i] ; penalty += exp_time ; points ++;  
+			}
+		}
+		return new int[]{points,penalty};   //http://community.topcoder.com/stat?c=problem_statement&pm=11358
 	}
 	
-	public void checkCharMatch(){
-		System.out.println('1'+1);
+	/**
+	 * 
+	 * Dynamic programming L1 problems
+	 * 
+	 * learning - range & sequences problem
+	 * 
+	 */
+	int maxTurns(int[] cards)
+	{
+		Arrays.sort(cards); 
+		int turns =0,i=0;
+		
+		for(i=0;i<cards.length-1;i++)
+		{
+			if(cards[i]!=0)
+				turns++; 
+			
+			if(cards[i]+1==cards[i+1])
+				cards[i+1]=0;
+		}
+		
+		if(cards[i]!=0) 
+			turns++;
+		
+		return turns;   //http://community.topcoder.com/stat?c=problem_statement&pm=11341
 	}
-
+	
 }