yaar it was sooo easy,,,room mein aa utkarsh btata hun..
On Tue, Mar 29, 2011 at 6:05 AM, bittu wrote:
> @utkarsh i was just about to put Huffman algo ..yes it is optimized
> answer to solve the problem
>
> @all basicaly we have to minimize the cost of intermediate path ,final
> o/p will ob
i am getting 1.room pe aa btata hun..
On Sat, Mar 12, 2011 at 9:25 AM, UTKARSH SRIVASTAV
wrote:
> then what should be the answer of the test case 1 3 5 . i am getting 2 as
> answer
>
>
> On Sat, Mar 12, 2011 at 2:22 AM, Balaji Ramani
> wrote:
>
>> Try with trees at 1 3 and 5. Gives wrong out
launda pelu nikla.
On Thu, Mar 10, 2011 at 10:22 AM, UTKARSH SRIVASTAV wrote:
> WELL I HAVE DONE THIS PROBLEM .HERE IS THE CODE
> #include
> #include
> using namespace std;
> main()
> {
> long long int t[2][2010],price[2010],r,c,i,j,n;
> scanf("%lld",&n);
> for(i=0;i {
>
