We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
https://www.acmicpc.net/problem/25644
문제의 핵심을 요약한다. 체계적인 문제 접근을 위해, 문제를 추상화한다
적합한 자료구조를 생각한다
# 1 --- # 2 --- # 3
추상화한 문제 이해를 기반으로 알고리즘의 대략적인 구현 계획을 서술한다
idea를 수도 코드로 작성해본다
알고리즘의 유효 여부를 구현 전에 검증한다
예제 입력을 수도 코드로 계산해보고, 놓친 알고리즘 오류가 있는지 확인한다
import sys readl = sys.stdin.readline def f(): readl() nums = [int(i) for i in readl().rstrip().split()] max_num = nums[-1] max_earning = 0 for num in reversed(nums): if num > max_num: max_num = num else: max_earning = max(max_earning, max_num - num) print(max_earning) f()
Greedy approach 그림으로 설명 https://velog.io/@kohyeonseo1006/C-BOJ-25644-%EC%B5%9C%EB%8C%80-%EC%83%81%EC%8A%B9
DP solution https://devteo77.tistory.com/11 https://msj725.tistory.com/119 https://gerbon.tistory.com/33
The text was updated successfully, but these errors were encountered:
새로운 문제를 풀지 말고, 풀었던 문제를 복습(review)하자
Sorry, something went wrong.
hojongs
No branches or pull requests
Problem link
https://www.acmicpc.net/problem/25644
Problem abstraction
Design(Plan) algorithm
Algorithm idea
Pseudo-code
Validate algorithm
Impl
Self-feedback
Greedy approach 그림으로 설명
https://velog.io/@kohyeonseo1006/C-BOJ-25644-%EC%B5%9C%EB%8C%80-%EC%83%81%EC%8A%B9
DP solution
https://devteo77.tistory.com/11
https://msj725.tistory.com/119
https://gerbon.tistory.com/33
구조적 접근: 문제를 추상화하여 구조적으로 접근했는가?
사고력: 알고리즘을 완전히 이해했는가? (충분한 사고력을 가졌는가?)
구현력: 알고리즘을 신속, 정확하게 구현했는가?
The text was updated successfully, but these errors were encountered: