lickelon.log

문제 링크 : boj.kr/1516난이도 : G3태그 : DP코드#include #define all(x) (x).begin(), (x).end()#define INF 0x7FFFFFFFusing namespace std;using ll = long long;using ld = long double;using pii = pair;using pll = pair;int main(){ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; vector>> arr(n); for(auto &e : arr) { cin >> e.first; while(true) { int in..

문제 링크 : boj.kr/1309난이도 : S1태그 : DP코드#include #define all(x) (x).begin(), (x).end()#define INF 0x7FFFFFFF#define MOD 9901using namespace std;using ll = long long;using ld = long double;using pii = pair;using pll = pair;int main(){ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; vector> arr(n); //None, Left, Right arr[0] = {1,1,1}; for(int i = 1; i 풀이한 행에 가능..

문제 링크 : boj.kr/23560난이도 : S2태그 : DP코드#include #define all(x) (x).begin(), (x).end()#define INF 0x7FFFFFFFusing namespace std;using ll = long long;using ld = long double;using pii = pair;using pll = pair;int main(){ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; ll ans = 2; for(int i = 1; i 풀이우선 약봉지는 좌우 대칭이므로 처음 먹는 약을 앞에서 먹는 것으로 고정하고 생각해보자.시뮬레이션 해보면 An-1, An-..

문제 링크 : boj.kr/11060난이도 : S2태그 : DP코드#include #define all(x) (x).begin(), (x).end()#define INF 987654321using namespace std;using ll = long long;using ld = long double;using pii = pair;using pll = pair;int main(){ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; vector arr(n); for(auto &e : arr) cin >> e; vector dp(n, INF); dp[0] = 0; for(int i = ..

문제 링크 : boj.kr/11722난이도 : S2태그 : DP코드#include #define all(x) (x).begin(), (x).end()#define INF 0x7FFFFFFFusing namespace std;using ll = long long;using ld = long double;using pii = pair;using pll = pair;int main(){ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; vector arr(n), dp(n, 0); for(auto &e : arr) cin >> e; for(int i = 0; i arr[i]) M = max(M, dp[j..

문제 링크 : boj.kr/17211난이도 : S5태그 : 확률론, DP코드#include #define all(x) (x).begin(), (x).end()#define INF 0x7FFFFFFFusing namespace std;using ll = long long;using ld = long double;using pii = pair;using pll = pair;int main(){ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, c; cin >> n >> c; ld p[2][2]; cin >> p[0][0] >> p[0][1] >> p[1][0] >> p[1][1]; vector> dp(n+1); d..

문제 링크 : boj.kr/11055난이도 : S2태그 : DP코드#include #define all(x) (x).begin(), (x).end()#define INF 0x7FFFFFFFusing namespace std;using ll = long long;using ld = long double;using pii = pair;using pll = pair;int main(){ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; vector arr(n), dp(n, 0); for(auto &e : arr) cin >> e; for(int i = 0; i 풀이DP[i] = max(DP[0], .....

문제 링크 : boj.kr/11568난이도 : S2태그 : DP, LIS코드#include #define all(x) (x).begin(), (x).end()#define INF 0x7FFFFFFFusing namespace std;using ll = long long;using ld = long double;using pii = pair;using pll = pair;int main(){ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; vector arr(n), dp(n, 0); for(auto &e : arr) cin >> e; for(int i = 0; i 풀이N이 1000으로 작기 때문에 ..

문제 링크 : boj.kr/2673난이도 : P4태그 : DP코드#include #define all(x) (x).begin(), (x).end()#define INF 0x7FFFFFFFusing namespace std;using ll = long long;using ld = long double;using pii = pair;using pll = pair;int main(){ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; int edge[101][101] = {}; int dp[101][101] = {}; for(int i = 0; i > a >> b; if(a>b) swap(a..

문제 링크 : boj.kr/2096난이도 : G5태그 : DP코드#include #define all(x) (x).begin(), (x).end()#define INF 0x7FFFFFFFusing namespace std;using ll = long long;using ld = long double;using pii = pair;using pll = pair;int main(){ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; array arr, M, m, temp; for(int i = 0; i > arr[0] >> arr[1] >> arr[2]; temp[0] = max({M[0], M..