반응형
유명한 dp문제..
int solution(vector<int> &A) {
// write your code in C++14 (g++ 6.2.0)
int dp[1000000]={0,};
dp[0] = A[0];
int answer = A[0];
for(int i=1; i<A.size(); i++){
dp[i] = max(dp[i-1]+A[i], A[i]);
answer = max(dp[i],answer);
}
return answer;
}
반응형
'코테' 카테고리의 다른 글
[Codility] MinPerimeterRectangle C++ (0) | 2022.01.09 |
---|---|
[Codility] Flags C++ (0) | 2022.01.08 |
[Codility] EquiLeader C++ (0) | 2022.01.08 |
[Codility] Nesting C++ (0) | 2022.01.08 |
[Codility] Fish C++ (0) | 2022.01.07 |