左眼皮跳跳

Sliding Window Time Limit: 12000MS   Memory Limit: 65536K Total Submissions: 42278   Accepted: 12479 Case Time Limit: 5000MS Description An array of size n ≤ 106 i

Problem Description There is a sequence of integers. Your task is to find the longest subsequence that satisfies the following condition: the difference between the maximum element and the minimum el

Problem Description Given a circle sequence A[1],A[2],A[3]......A[n]. Circle sequence means the left neighbour of A[1] is A[n] , and the right neighbour of A[n] is A[1]. Now your job is to calculate

Problem Description You are given a sequence of n numbers a0,..., an-1. A cyclic shift by k positions (0k ak+1,..., an-1, a0, a1,..., ak-1. How many of the n cyclic shifts satisfy the condition tha