보통 직장인의 지식 생활

http://www.jungol.co.kr/bbs/board.php?bo_table=pbank&wr_id=1508&sca=99&sfl=wr_hit&stx=2247 JUNGOL www.jungol.co.kr #include struct time { int min, max; } stdt[10010], sol[10010], tmp[10010]; int N, solnum, longtime, emptytime; void mergesort(int s, int e) { int m = (s + e) / 2, k = s, a = s, b = m + 1; if (s >= e) return; mergesort(s, m); mergesort(m + 1, e); while (a

http://www.jungol.co.kr/bbs/board.php?bo_table=pbank&code=2194 JUNGOL www.jungol.co.kr #include int C[10010], Y[10010], S, N; unsigned long long cost; int main(void) { //freopen("input.txt", "r", stdin); scanf("%d %d", &N, &S); for (int i = 0; i < N; i++) scanf("%d %d", C + i, Y + i); //S는 리터당 1주일 보관 비용, C는 우유가격, Y는 그 주 필요한 우유 for (int i = 0, j; i < N; i++) { //Y 기준 int mp = 5555, com = 0; for (..

http://www.jungol.co.kr/bbs/board.php?bo_table=pbank&wr_id=2283&sca=99&sfl=wr_hit&stx=2082 JUNGOL www.jungol.co.kr #include int ar[500100], cnt, N, ans[500100], anscnt; void swap(int& rA, int& rB) { int tmp = rA;rA = rB;rB = tmp; } void heapify() { int ci = cnt; //childindex while (ci > 1 && ar[ci / 2] < ar[ci]) { swap(ar[ci], ar[ci / 2]); ci /= 2; } } int pop() { int first = ar[1]; swap(ar[1], ..

http://www.jungol.co.kr/bbs/board.php?bo_table=pbank&wr_id=1245&sca=99&sfl=wr_hit&stx=1972 JUNGOL www.jungol.co.kr #include int ar[100010], ans[100010], N, C; void mergesort(int* pArr, int s, int e) { if (s >= e) return; int m = (s + e) / 2; mergesort(pArr, s, m); mergesort(pArr, m + 1, e); int i = s, j = m + 1, k = s; while (i

http://www.jungol.co.kr/bbs/board.php?bo_table=pbank&wr_id=1185&sca=99&sfl=wr_hit&stx=1912 JUNGOL www.jungol.co.kr #include int N, M, s, e, cnt=1; bool checked[100001]; struct Pair { int x, y; } IA1[1000001], IA2[1000001]; struct Match { Match* pPrev; Match* pNext; int linked; Match(Match* prev, Match* next, int val) : pPrev(prev), pNext(next), linked(val) { if (prev != nullptr) prev->pNext = th..

http://www.jungol.co.kr/bbs/board.php?bo_table=pbank&wr_id=1174&sca=99&sfl=wr_hit&stx=1901 JUNGOL www.jungol.co.kr #include int N; int M[110]; bool bPrime[1000010]; void Input() { scanf("%d", &N); for (int i = 0; i < N; i++) scanf("%d", M + i); } bool IsPrime(int n) { if (bPrime[n]) return true; for (int i = 2; i * i 1000000)return 0; else if (IsPrime(n))return n; elsereturn GetUpperPrime(n + 1)..

http://www.jungol.co.kr/bbs/board.php?bo_table=pbank&wr_id=1158&sca=99&sfl=wr_hit&stx=1885 JUNGOL www.jungol.co.kr #include const int LM = 1 1 && *s && *s == *t) ++s, ++t, --n; return *s - *t; } int strcmp(const char* s, const char* t) { while (*s && *s == *t) s++, t++; return *s - *t; } int T, N, bcnt, wlen[10010], wcnt[11]; char word[10010][105]; struct data { char* str; int idx; int len; data..

http://www.jungol.co.kr/bbs/board.php?bo_table=pbank&wr_id=1113&sca=99&sfl=wr_hit&stx=1840 JUNGOL www.jungol.co.kr #include //녹을 치즈는 2번으로, 빈 공간은 3번부터 순차 증가 int cheese[105][105], R, C, meltedCheese, hour; enum { EMPTY = 0, CHEESE, //1 MELT, //2 CHECKED //3 }; struct P { int r, c; } que[50000]; int s, e, dr[4] = { 0, 0, 1,-1 }, dc[4] = { 1, -1, 0, 0 }; void enque(int r, int c) { que[e].r = r, que[..

http://www.jungol.co.kr/bbs/board.php?bo_table=pbank&wr_id=1109&sca=99&sfl=wr_hit&stx=1836 JUNGOL www.jungol.co.kr #include int sum[100010], max, N; int main(void) { scanf(" %d", &N); for (int i = 1; i 0) sum[i] = sum[i - 1] + tmp; else sum[i] = tmp; if (sum[i] > max) max = sum[i]; } printf("%d\n", max); return 0; }

http://www.jungol.co.kr/bbs/board.php?bo_table=pbank&wr_id=1101&sca=99&sfl=wr_hit&stx=1828 JUNGOL www.jungol.co.kr #include struct band { int min, max; } C[105], Ans[105], tmp[105]; int Ccnt, Acnt; void mergesort(int s, int e) { if (s >= e) return; int m = (s + e) / 2; mergesort(s, m); mergesort(m + 1, e); int k = s, a = s, b = m + 1; while (a