본문 바로가기 메뉴 바로가기

Data Makes Our Future

프로필사진
  • 글쓰기
  • 관리
  • 태그
  • 방명록
  • RSS

Data Makes Our Future

검색하기 폼
  • 분류 전체보기 (740)
    • Data (18)
      • Statistics (10)
      • Analysis (8)
    • SQL (24)
      • Organize (3)
      • Install (2)
    • R (58)
      • Collection (4)
      • Process (33)
      • Analysis (11)
      • Visualize (4)
      • Install (3)
    • Python (56)
      • Collection (10)
      • Process (27)
      • Visualize (2)
      • Install (3)
    • Web (164)
      • API (16)
      • Spring (58)
      • JAVA (49)
      • Infra (11)
    • PS (366)
      • Algorithm (45)
      • Problem_Solving (311)
      • PS_Note (7)
    • Books (35)
    • ADsP (4)
    • eTc (15)
  • 방명록

2167 (1)
[BOJ] 2167. 2차원 배열의 합(DP, 누적합).py.cpp

#. Problemhttps://www.acmicpc.net/problem/2167* The copyright in this matter is in BOJ #. Resolution Process 1. Read and understand problem 2. Redefine the problem + abstract 3. Create solution plan (select Algorithm, Data structure) 4. Prove the plan (check performance time and usage memory) 5. Carry out the plan 6. Look back on the plan and find a way to improve it #. Solve최대 배열의 크기는 300x300 =..

PS/Problem_Solving 2020. 6. 4. 22:55
이전 1 다음
이전 다음
최근에 올라온 글
최근에 달린 댓글
링크
  • Gitbook
  • resume
Total
Today
Yesterday
TAG
  • java
  • BOJ
  • BFS
  • c++
  • dp
  • PYTHON
  • C
  • DATA
  • R
  • 백준
  • DFS
  • 시뮬레이션
  • coding
  • spring
  • Algorithm
more

Blog is powered by Tistory / Designed by Tistory

티스토리툴바