한국으로/알고리즘 문제풀이15 [문제풀이] 3967번: 매직 스타 [문제풀이]https://www.acmicpc.net/problem/3967 문제유형DFS, 아이디어 *인덱스를 생각하고 만드는 게 중요했던 문제. Solution1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381.. 2018. 7. 5. [문제풀이] 5397번: 키로거 [문제풀이] 5397번: 키로거https://www.acmicpc.net/problem/5397 문제유형연결리스트 Solution123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130#include struct NODE{ char ch; struct NODE* .. 2018. 7. 5. [문제풀이] 6549번: 히스토그램에서 가장 큰 직사각형 [문제풀이] 6549번: 히스토그램에서 가장 큰 직사각형https://www.acmicpc.net/problem/6549 문제유형스택 Solution123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051#include int N;struct STACK{ int h, pos;}stack[100000 + 10];#define MAX(a,b) ((a)>(b)?(a):(b))int input_data(void){ scanf("%d", &N); if (N == 0)return 1; return 0;}long long solve(void){ int sp = 0; long long max = 0, area.. 2018. 7. 5. [문제풀이] 2512번: 예산 [문제풀이] 2512번: 예산https://www.acmicpc.net/problem/2512 문제유형이진탐색 Solution1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162#include int N;long long M; //총예산int yesan[10010];int max; void inputData(){ scanf("%d", &N); for (register int i = 0; i 2018. 7. 5. 이전 1 2 3 4 다음