# average slice 2022年11月23日
0 收藏 483 点赞 3,966 浏览 1366 个字

A non-empty zero-indexed array A consisting of N integers is given. A pair of integers (P, Q), such that 0 ≤ P < Q < N, is called a slice of array A (notice that the slice contains at least two elements). The average of a slice (P, Q) is the sum of A[P] + A[P + 1] + … + A[Q] divided by the length of the slice. To be precise, the average equals (A[P] + A[P + 1] + … + A[Q]) / (Q − P + 1).

For example, array A such that:

`    A = 4    A = 2    A = 2    A = 5    A = 1    A = 5    A = 8`

contains the following example slices:

• slice (1, 2), whose average is (2 + 2) / 2 = 2;

• slice (3, 4), whose average is (5 + 1) / 2 = 3;
• slice (1, 4), whose average is (2 + 2 + 5 + 1) / 4 = 2.5.

The goal is to find the starting position of a slice whose average is minimal.

Write a function:

int solution(int A[], int N);

that, given a non-empty zero-indexed array A consisting of N integers, returns the starting position of the slice with the minimal average. If there is more than one slice with a minimal average, you should return the smallest starting position of such a slice.

For example, given array A such that:

`    A = 4    A = 2    A = 2    A = 5    A = 1    A = 5    A = 8`

the function should return 1, as explained above.

Assume that:

• N is an integer within the range [2..100,000];

• each element of array A is an integer within the range [−10,000..10,000].

Complexity:

• expected worst-case time complexity is O(N);

• expected worst-case space complexity is O(N), beyond input storage (not counting the storage required for input arguments).

Elements of input arrays can be modified. 微信扫一扫 支付宝扫一扫 python开发_常用的python模块及安装方法 Educational Codeforces Round 11 C. Hard Process 二分
C. Hard Process题目连接：http://www.codeforces.com/contest/660/problem/CDes… zengkefu@server1:/usr/src\$ uname -aLinux server1 4.10.0-19-generic #21…  Android调用系统相机、自定义相机、处理大图片
Android调用系统相机和自定义相机实例本博文主要是介绍了android上使用相机进行拍照并显示的两种方式，并且由于涉及到要把拍到的照片显… Struts的使用 