Life Long Programmer's Community Log: 2014-08-24

Segment Tree | Set 1 (Sum of given range) - GeeksforGeeks We have an array arr[0 . . . n-1]. We should...

Please Visit: http://ift.tt/1ajReyV

Segment Tree | Set 1 (Sum of given range) - GeeksforGeeks

We have an array arr[0 . . . n-1]. We should be able to

1 Find the sum of elements from index l to r where 0 <= l <= r <= n-1

2 Change value of a specified element of the array arr[i] = x where 0 <= i <= n-1.

http://ift.tt/1iSlJRL

http://ift.tt/1pu4JJc

Segment Tree | Set 1 (Sum of given range) - GeeksforGeeks

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1tYlcF0

via LifeLong Community

2785 -- 4 Values whose Sum is 0 The SUM problem can be formulated as follows: given four lists A, B,...

Please Visit: http://ift.tt/1ajReyV

2785 -- 4 Values whose Sum is 0

The SUM problem can be formulated as follows: given four lists A, B, C, D of integer values, compute how many quadruplet (a, b, c, d ) ∈ A x B x C x D are such that a + b + c + d = 0 . In the following, we assume that all lists have the same size n .

InputThe first line of the input file contains the size of the lists n (this value can be as large as 4000). We then have n lines containing four integer values (with absolute value as large as 228 ) that belong respectively to A, B, C and D .

http://ift.tt/1wRSev9

http://ift.tt/1tWSJPR

2785 -- 4 Values whose Sum is 0

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1wRSeLn

via LifeLong Community

[ACM] POJ 3061 Subsequence (尺取法） - 逆风的方向更适合飞翔 - 博客频道 - CSDN.NET Description A sequence of N positive...

Please Visit: http://ift.tt/1ajReyV

[ACM] POJ 3061 Subsequence (尺取法） - 逆风的方向更适合飞翔 - 博客频道 - CSDN.NET

Description

A sequence of N positive integers (10 < N < 100 000), each of them less than or equal 10000, and a positive integer S (S < 100 000 000) are given. Write a program to find the minimal length of the subsequence of consecutive elements of the sequence, the sum

of which is greater than or equal to S.

Input

The first line is the number of test cases. For each test case the program has to read the numbers N and S, separated by an interval, from the first line. The numbers of the sequence are given in the second line of the test case, separated by intervals. The

input will finish with the end of file.

http://ift.tt/1zWoDgb

http://ift.tt/1psO7l3

[ACM] POJ 3061 Subsequence (尺取法） - 逆风的方向更适合飞翔 - 博客频道 - CSDN.NET

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1zWoBVw

via LifeLong Community

POJ 3111 K Best 题解《挑战程序设计竞赛》 – 码农场 POJ 3111 K Best (Link->http://ift.tt/1psOa0c...

Please Visit: http://ift.tt/1ajReyV

POJ 3111 K Best 题解《挑战程序设计竞赛》 – 码农场

POJ 3111 K Best (Link->http://ift.tt/1zWoCZG)

卖宝救夫：Demy要卖珠宝，n件分别价值vi 重 wi，她希望保留k件使得

最大。

http://ift.tt/1psO7kX

http://ift.tt/1zWoCZK

POJ 3111 K Best 题解《挑战程序设计竞赛》 – 码农场

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1psO7kZ

via LifeLong Community

POJ 3253--Fence Repair - 从此爱上猫 - ITeye技术网站 http://ift.tt/1wPI3aq

Please Visit: http://ift.tt/1ajReyV

POJ 3253--Fence Repair - 从此爱上猫 - ITeye技术网站

http://ift.tt/1wPI3aq

POJ 3253--Fence Repair - 从此爱上猫 - ITeye技术网站

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1zTNJMH

via LifeLong Community

POJ 1852 Ants || UVA 10881 – Piotr's Ants 经典的蚂蚁问题 | riaos http://ift.tt/1zTNJwi

Please Visit: http://ift.tt/1ajReyV

POJ 1852 Ants || UVA 10881 – Piotr's Ants 经典的蚂蚁问题 | riaos

http://ift.tt/1zTNJwi

POJ 1852 Ants || UVA 10881 – Piotr's Ants 经典的蚂蚁问题 | riaos

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1wPI5iu

via LifeLong Community

算法之美——博弈论 + 按位异或 - 小熊不去实验室 - 博客频道 - CSDN.NET http://ift.tt/1tT7qDB

Please Visit: http://ift.tt/1ajReyV

算法之美——博弈论 + 按位异或 - 小熊不去实验室 - 博客频道 - CSDN.NET

http://ift.tt/1tT7qDB

算法之美——博弈论 + 按位异或 - 小熊不去实验室 - 博客频道 - CSDN.NET

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1tT7qDD

via LifeLong Community

每日一题(14)——找到符合要求的整数 - 小熊不去实验室 - 博客频道 - CSDN.NET http://ift.tt/1tT7nYr...

Please Visit: http://ift.tt/1ajReyV

每日一题(14)——找到符合要求的整数 - 小熊不去实验室 - 博客频道 - CSDN.NET

http://ift.tt/1tT7nYr

每日一题(14)——找到符合要求的整数 - 小熊不去实验室 - 博客频道 - CSDN.NET

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1tT7qDo

via LifeLong Community

《编程之美：分层遍历二叉树》的另外两个实现 - Milo Yip - 博客园 http://ift.tt/1qIc9aR...

Please Visit: http://ift.tt/1ajReyV

《编程之美：分层遍历二叉树》的另外两个实现 - Milo Yip - 博客园

http://ift.tt/1qIc7Qa

《编程之美：分层遍历二叉树》的另外两个实现 - Milo Yip - 博客园

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1tQGiVL

via LifeLong Community

《编程之美: 求二叉树中节点的最大距离》的另一个解法 - Milo Yip - 博客园 http://ift.tt/1tQGhkv...

Please Visit: http://ift.tt/1ajReyV

《编程之美: 求二叉树中节点的最大距离》的另一个解法 - Milo Yip - 博客园

http://ift.tt/1qIc8DT

《编程之美: 求二叉树中节点的最大距离》的另一个解法 - Milo Yip - 博客园

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1tQGiVz

via LifeLong Community

Graph Coloring | Set 2 (Greedy Algorithm) - GeeksforGeeks http://ift.tt/1qIc6M7...

Please Visit: http://ift.tt/1ajReyV

Graph Coloring | Set 2 (Greedy Algorithm) - GeeksforGeeks

http://ift.tt/1tQGg01

Graph Coloring | Set 2 (Greedy Algorithm) - GeeksforGeeks

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1qIc5rI

via LifeLong Community

每日一题(5)——公正陪审团问题(动态规划) - 小熊不去实验室 - 博客频道 - CSDN.NET http://ift.tt/1lj7tI7...

Please Visit: http://ift.tt/1ajReyV

每日一题(5)——公正陪审团问题(动态规划) - 小熊不去实验室 - 博客频道 - CSDN.NET

http://ift.tt/1lj7tI7

每日一题(5)——公正陪审团问题(动态规划) - 小熊不去实验室 - 博客频道 - CSDN.NET

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1mZPyC2

via LifeLong Community

My first five Lucene mistakes | Code and comments http://ift.tt/1mZPy4Z...

Please Visit: http://ift.tt/1ajReyV

My first five Lucene mistakes | Code and comments

http://ift.tt/1mZPylh

My first five Lucene mistakes | Code and comments

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1lj7snD

via LifeLong Community

Lucene and Solr's CheckIndex to the Rescue! | Javalobby http://ift.tt/1lj7s7d...

Please Visit: http://ift.tt/1ajReyV

Lucene and Solr's CheckIndex to the Rescue! | Javalobby

http://ift.tt/1lj7qMG

Lucene and Solr's CheckIndex to the Rescue! | Javalobby

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1mZPwtQ

via LifeLong Community

每日一题(19)——数组分割（动态规划） - 小熊不去实验室 - 博客频道 - CSDN.NET http://ift.tt/1sJUOwA...

Please Visit: http://ift.tt/1ajReyV

每日一题(19)——数组分割（动态规划） - 小熊不去实验室 - 博客频道 - CSDN.NET

http://ift.tt/1sJUOwA

每日一题(19)——数组分割（动态规划） - 小熊不去实验室 - 博客频道 - CSDN.NET

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1sJUNJa

via LifeLong Community

How is the default java heap size determined? - Stack Overflow You can use the following command to...

Please Visit: http://ift.tt/1ajReyV

How is the default java heap size determined? - Stack Overflow

You can use the following command to find out the defaults on the system where your applications runs.

java -XX:+PrintFlagsFinal -version

Look for the options MaxHeapSize (for -Xmx) and InitialHeapSize for -Xms.

On a Unix/Linux system, you can do

java -XX:+PrintFlagsFinal -version | grep HeapSize

http://ift.tt/1sJcFUl

http://ift.tt/1qF5gqH

How is the default java heap size determined? - Stack Overflow

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1sJcGHU

via LifeLong Community

Find Max sum in a 2D array | PROGRAMMING INTERVIEWS What is needed for extending kadane algorithm is...

Please Visit: http://ift.tt/1ajReyV

Find Max sum in a 2D array | PROGRAMMING INTERVIEWS

What is needed for extending kadane algorithm is as followed:

Traverse matrix at row level.

have a temporary 1-D array and initialize all members as 0.

For each row do following:

add value in temporary array for all rows below current row (including current row)

apply 1-D kadane on temporary array

if your current result is greater than current maximum sum, update.

http://ift.tt/1mVz8KK

http://ift.tt/1lgOTR9

Find Max sum in a 2D array | PROGRAMMING INTERVIEWS

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1mVz8KS

via LifeLong Community