Question:Say you have an array for which
theithelement is the price of a given stock on dayi.Design an algorithm to find
the maximum profit. You may c...
分类：
其他好文 时间：
2014-06-12 19:55:05
阅读次数：
292
Given a binary tree, find its maximum depth.The
maximum depth is the number of nodes along the longest path from the root node
down to the farthest le...
分类：
其他好文 时间：
2014-06-12 18:32:00
阅读次数：
222
原题地址：https://oj.leetcode.com/problems/maximum-subarray/题意：Find
the contiguous subarray within an array (containing at least one number) which
has the ...
分类：
编程语言 时间：
2014-06-12 17:06:04
阅读次数：
339
Binary Tree Maximum Path SumGiven a binary
tree, find the maximum path sum.The path may start and end at any node in the
tree.For example:Given the be...
分类：
其他好文 时间：
2014-06-10 10:42:58
阅读次数：
203
题目：Maximum Depth of Binary TreeGiven a binary tree,
find its maximum depth.The maximum depth is the number of nodes along the
longest path from the ro...
分类：
其他好文 时间：
2014-06-10 10:09:13
阅读次数：
237
Find the contiguous subarray within an array
(containing at least one number) which has the largest sum.For example, given
the array[?2,1,?3,4,?1,2,1,...
分类：
其他好文 时间：
2014-06-10 09:14:50
阅读次数：
211
Givennpoints on a 2D plane, find the maximum
number of points that lie on the same straight
line.每次固定一个点，然后遍历所有其它点，记录每种斜率出现的次数。需要考虑两种特殊情况：斜率不存在和点与固定点重...
分类：
其他好文 时间：
2014-06-10 08:44:57
阅读次数：
164
1、用退化的线段树（也就是没有区间查询）做。。。2、注意longlong。#include#include#include#includeusing
namespace std;int n,q;int a[200010],s[200010];int main(){
scanf("%d%d",&n,....
分类：
其他好文 时间：
2014-06-09 17:30:11
阅读次数：
227
