二分，贪心，动规

A - 二分 基础

Crawling in process... Crawling failed Time Limit:15000MS    Memory Limit:228000KB     64bit IO Format:%I64d & %I64u

Submit Status Practice POJ 2785

Description

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 .       

Input

The 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 2 ²⁸ ) that belong respectively to A, B, C and D .       

Output

For each input file, your program has to write the number quadruplets whose sum is zero.       

Sample Input

6
-45 22 42 -16
-41 -27 56 30
-36 53 -37 77
-36 30 -75 -46
26 -38 -10 62
-32 -54 -6 45

Sample Output

5

Hint

Sample Explanation: Indeed, the sum of the five following quadruplets is zero: (-45, -27, 42, 30), (26, 30, -10, -46), (-32, 22, 56, -46),(-32, 30, -75, 77), (-32, -54, 56, 30).

 

 

把前两组和后两组分别两两相加，对其中一个排序，用另一个用二分法在前一个中寻找。这道题主要耽误在大数组放在了main函数里。大数组一定要放在全局变量。

 

 

 

D - 简单dp 例题

Crawling in process... Crawling failed Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u

Submit Status

 

Description

Given a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), the max sum in this sequence is 6 + (-1) + 5 + 4 = 14.       

              

Input

The first line of the input contains an integer T(1<=T<=20) which means the number of test cases. Then T lines follow, each line starts with a number N(1<=N<=100000), then N integers followed(all the integers are between -1000 and 1000).       

              

Output

For each test case, you should output two lines. The first line is "Case #:", # means the number of the test case. The second line contains three integers, the Max Sum in the sequence, the start position of the sub-sequence, the end position of the sub-sequence. If there are more than one result, output the first one. Output a blank line between two cases.       

              

Sample Input

     
     

      
       2
5 6 -1 5 4 -7
7 0 6 -1 1 -6 7 -5 
     
     

              

Sample Output

     
     

      
       Case 1:
14 1 4

Case 2:
7 1 6 
     
     

        

 

 

动态规划。错在输出时数据和数据之间有endl，但是最后一个数据之后没有endl。