twh233的算法blog

659B #include using namespace std; #define LL long long #define INF 0x3f3f3f3 #define pi acos(-1) const int maxn=1e3+5; const int maxx=1e6+5; set >v[11111]; string s[111111]; int n,m,a[111111],

D. Winter Is Coming time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output The winter in Berland lasts n days. For

传送门 C. Ilya And The Tree time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Ilya is very fond o

传送门 转自：点击打开链接 input 9 10 5 4 7 9 12 6 2 10 output 20 input 20 3 1 4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 output 41 题意： 我们知道股票每一天的价格，当我们手中没有股票的时候不可以出售，问最后所能获得的最大价