Replicated

#include #include #include #include using namespace std;void Lcs(const string& X, const string& Y){ int N = X.size(); int M = Y.size(); vector > DP(N + 1, vector(M + 1, 0)); for (int i = 1; i 0 && j > 0) { if ( X[i - 1] == Y[j - 1] ) { lcs += X[i - 1]; --i; --j; } else if( DP[i - 1][j] > DP[i][j - 1] ) { ..

https://www.acmicpc.net/problem/11657 #include #include #include using namespace std;#define INF 2000000000struct Edge { int start; int end; int time;};int n, m;vector edges;long long dp[501];bool bellmanFord(int start) { dp[start] = 0; for (int i = 1; i dp[start] + time ) { dp[end] = dp[start] + time; if( i == n ) return true; ..

https://www.acmicpc.net/problem/2098#include #include #include using namespace std;#define INF 1000000000int graph[16][16];int dp[16][1> n; for (int i = 0; i > graph[i][j]; } } memset(dp, -1, sizeof(dp)); cout dp 배열은 현재 방문한 장소를 관리, 총 17비트0번 도시에서 시작하여 0도시로 돌아와야 함dp[i][bit]는 bit에 속하는 도시에 갔고 현재 i일때 도착하기까지 남은 최소 거리

// 5972#include #include #include using namespace std;const int INF = 2000000000;int N, M;struct Node{ int Idx; int Weight;};vector > Graph;struct cmp{ bool operator() (Node x, Node y) { return x.Weight > y.Weight; }};vector Dijkstra(int Start){ vector Distance(N + 1, INF); priority_queue, cmp> Heap; Distance[Start] = 0; Heap.push( {Start, 0} ); while ( !Heap..

https://www.acmicpc.net/problem/11404#include using namespace std;int main(int argc, const char * argv[]) { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int n, m; cin >> n >> m; // init int arr[n][n]; for (int i = 0; i > row >> col >> weight; if( arr[row - 1][col - 1] weight ){ arr[row - 1][col - 1] = weight; } }..

최대 냅색https://www.acmicpc.net/problem/12865#include #include #include using namespace std;struct Node { int weight; int value;};int main(int argc, const char * argv[]) { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int n, k; cin >> n >> k; vector > dp(n + 1, vector(k + 1, 0)); vector sack(n + 1); for (int i = 1; i > sack[i].weight; ..