메모장 입니다2

스티븐 잡스- 성공의 비결(모음)https://youtu.be/Q6WdpSh8s80

An array A consisting of N integers is given.N개의 정수로 구성된 배열 A가 주어진다. It contains daily prices of a stock share for a period of N consecutive days.그것엔 N의 연속된 기간동안의 주식 가격이 포함된다. If a single share was bought on day P and sold on day Q, where 0 ≤ P ≤ Q < N, then the profit of such transaction is equal to A[Q] − A[P], provided that A[Q] ≥ A[P].만약 단일 주식을 P날에 샀고 Q날에 팔았다면, 0

Chances are A A 일지도 모른다, A일 것이다. 예문: We found a program that is hiding a flag but requires you to guess the number it is thinking of. Chances are Linux has an easy way to try all the numbers... Go to /problems/f625672abc185c8d615f852c306d877f and try it out! 우리는 프로그램을 찾았다/ 플래그를 숨기는/ 그러나 요구한다/ 너가 추측하는 것을/ 생각하고 있는 숫자를/리눅스는 가지고 있을 지도 모른다/ 쉬운 방법을/ 모든 숫자를 시도하는/

A zero-indexed array A consisting of N integers is given. The dominator of array A is the value that occurs in more than half of the elements of A.For example, consider array A such that A[0] = 3 A[1] = 4 A[2] = 3 A[3] = 2 A[4] = 3 A[5] = -1 A[6] = 3 A[7] = 3The dominator of A is 3 because it occurs in 5 out of 8 elements of A (namely in those with indices 0, 2, 4, 6 and 7)and 5 is more than a h..

A non-empty zero-indexed array A consisting of N integers is given.The leader of this array is the value that occurs in more than half of the elements of A.An equi leader is an index S such that 0 ≤ S < N − 1 and two sequences A[0], A[1], ..., A[S] and A[S + 1], A[S + 2], ..., A[N − 1] have leaders of the same value. 비어있지 않은 제로 색인된 배열 A가/N개의 정수로 구성된/ 주어진다.이 배열의 리더는/값이다/ 일어나는/ 절반 이상에서/ A의 요소들 중. ..

You are given two non-empty zero-indexed arrays A and B consisting of N integers. Arrays A and B represent N voracious fish in a river, ordered downstream along the flow of the river. 너는 주어진다 두개의 배열 A와 B가/ N개의 정수로 이루어진. 배열 A와 B는 나타낸다/ N개의 방대한 물고기를/ 강에있는, 강의 흐름을 따라 The fish are numbered from 0 to N − 1. If P and Q are two fish and P < Q, then fish P is initially upstream of fish Q. Initially, eac..

You are going to build a stone wall. The wall should be straight and N meters long, and its thickness should be constant; however, it should have different heights in different places. 너는 돌벽을 지을 것이다. 그 벽은 직선이어야 하고, 길이가 N 미터이고, 그것의 두께는 일정해야 한다.그런데, 그것은 다른 가져야 한다/ 다른 높이를 다른 공간에서. The height of the wall is specified by an array H of N positive integers. H[I] is the height of the wall from I to I+1 ..

A string S consisting of N characters is considered to be properly nested if any of the following conditions is true:S is empty;S has the form "(U)" or "[U]" or "{U}" where U is a properly nested string;S has the form "VW" where V and W are properly nested strings.For example, the string "{[()()]}" is properly nested but "([)()]" is not. N개의 문자로 구성된 문자열 S는 간주된다/ 적절히 중첩됬다고/ 만약 다음 조건 중 하나라도 참이라면: ..