These days, you can do all sorts of things online. For example, you can use various websites to make virtual friends. For some people, growing their social network (their friends, their friends' fr...
ACM
Vasya and String(尺取法)
High school student Vasya got a string of length n as a birthday present. This string consists of letters 'a' and 'b' only. Vasya denotes beauty of the string as the maximum length of a...
NPY and shot (物理题)
NPY is going to have a PE test.One of the test subjects is throwing the shot.The height of NPY is H meters.He can throw the shot at the speed of v0 m/s and at the height of exactly H meters...
Cable master (深坑)
Inhabitants of the Wonderland have decided to hold a regional programming contest. The Judging Committee has volunteered and has promised to organize the most honest contest ever. It was de...
The Meeting Place Cannot Be Changed (codeforces 782B)(二分法)
题目: The main road in Bytecity is a straight line from south to north. Conveniently, there are coordinates measured in meters from the southernmost building in north direction. ...
Can you solve this equation?
Now,given the equation 8*x^4 + 7*x^3 + 2*x^2 + 3*x + 6 == Y,can you find its solution between 0 and 100; Now please try your lucky. InputThe first line of the input contains an integer T(...
Right turn SCU – 4445
Right turn frog is trapped in a maze. The maze is infinitely large and divided into grids. It also consists of \(n\) obstacles, where the \(i\)-th obstacle lies in grid \((x_i, y_i)\). ...
使用单调队列优化的 O(nm) 多重背包算法 (转)
最近在翻看国家队集训论文的时候发现提到了使用单调队列来优化多重背包,于是找到了这个博文,觉得不错,转发过来慢慢理解 解析 令 c[i] = min(num[i], j / v[i]) f[i][j] = max(f[i-1][j-k*v[i]] + k*w[i...
Charm Bracelet POJ – 3624 (01背包问题)
Version:1.0 StartHTML:000000193 EndHTML:000002773 StartFragment:000000845 EndFragment:000002715 StartSelection:000000845 EndSelection:000002715 SourceURL:http://poj.org/problem?id=36243624 -- Charm...
The Suspects ZOJ – 1789 (并查集)
Severe acute respiratory syndrome (SARS), an atypical pneumonia of unknown aetiology, was recognized as a global threat in mid-March 2003. To minimize transmission to others, the best strategy is t...