DeaL0124

摘要： Problem Statement Let NN be a positive odd number. There are NN coins, numbered 1,2,…,N1,2,…,N. For each ii (1≤i≤N1≤i≤N), when Coin ii is tossed, it c 阅读全文

摘要： Description YYF is a couragous scout. Now he is on a dangerous mission which is to penetrate into the enemy's base. After overcoming a series difficul 阅读全文

摘要： #include <iostream> #include <vector> #include <algorithm> #include <string> #include <set> #include <queue> #include <map> #include <sstream> #includ 阅读全文

摘要： Problem Statement There is a grid with HH horizontal rows and WW vertical columns. Let (i,j)(i,j) denote the square at the ii-th row from the top and 阅读全文

摘要： Problem Statement There is a directed graph GG with NN vertices and MM edges. The vertices are numbered 1,2,…,N1,2,…,N, and for each ii (1≤i≤M1≤i≤M), 阅读全文

摘要： Problem Statement You are given strings ss and tt. Find one longest string that is a subsequence of both ss and tt. Notes A subsequence of a string xx 阅读全文

摘要： Problem Statement There are NN items, numbered 1,2,…,N1,2,…,N. For each ii (1≤i≤N1≤i≤N), Item ii has a weight of wiwi and a value of vivi. Taro has de 阅读全文

摘要： Problem Statement There are NN items, numbered 1,2,…,N1,2,…,N. For each ii (1≤i≤N1≤i≤N), Item ii has a weight of wiwi and a value of vivi. Taro has de 阅读全文

摘要： Problem Statement Taro's summer vacation starts tomorrow, and he has decided to make plans for it now. The vacation consists of NN days. For each ii ( 阅读全文

摘要： Problem Statement There are NN stones, numbered 1,2,…,N1,2,…,N. For each ii (1≤i≤N1≤i≤N), the height of Stone ii is hihi. There is a frog who is initi 阅读全文