우투리와툴툴

연속합https://www.acmicpc.net/problem/1912 1234567891011121314151617181920212223242526272829303132#include int main(void){ int N; int number[100010] = {}; int Dp[100010] = {}; int max; scanf("%d", &N); for (int i = 1; i

가장 긴 바이토닉 부분 수열https://www.acmicpc.net/problem/11054 1234567891011121314151617181920212223242526272829303132333435363738394041424344454647#include int main(void){ int N; int Dp[2][1010] = {}; int A[1010] = {}; int max = 0; scanf("%d", &N); for (int i = 1; i A[j]){ if (maxA

가장 긴 감소하는 부분 수열https://www.acmicpc.net/problem/11722 1234567891011121314151617181920212223242526272829#include int main(void){ int N; int Dp[1010] = {}; int A[1010] = {}; int max = 0; scanf("%d", &N); for (int i = 1; i

가장 큰 증가 부분 수열 https://www.acmicpc.net/problem/11055 1234567891011121314151617181920212223242526272829#include int main(void){ int N; int Dp[1010] = {}; int A[1010] = {}; int max = 0; scanf("%d", &N); for (int i = 1; i

가장 긴 증가 부분 수열https://www.acmicpc.net/problem/11053 1234567891011121314151617181920212223242526272829#include int main(void){ int N; int Dp[1010] = {}; int A[1010] = {}; int max = 0; scanf("%d", &N); for (int i = 1; i

포도주 시식https://www.acmicpc.net/problem/2156 1234567891011121314151617181920212223242526272829303132#include int max(int a, int b){ return a > b ? a : b;} int main(void){ int N; int wine[10010] = {}; int Dp[10010] = {}; scanf("%d", &N); for (int i = 1; i

나는야 포켓몬 마스터 이다솜https://www.acmicpc.net/problem/1620 123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354#include #include #include #include using namespace std;string c[100001]; map abc; int main(void){ int N, M; scanf("%d %d", &N, &M); for (int i = 0; i

이친수https://www.acmicpc.net/problem/2193 12345678910111213141516171819#include int main(void){ long long int N; long long int Dp[95][2] = {}; scanf("%lld", &N); Dp[1][0] = 1; Dp[1][1] = 1; for (int i = 2; i

오르막수https://www.acmicpc.net/problem/11057 12345678910111213141516171819202122232425#include #define mod 10007 int main(void){ int N; int number[1001][10] = {}; int total = 0; scanf("%d", &N); for (int i = 0; i

쉬운 계단 수https://www.acmicpc.net/problem/10844 1234567891011121314151617181920212223#include #define mod 1000000000int main(void){ int N; int Dp[101][10] = {}; int sum = 0; scanf("%d", &N); for (int i = 0; i