CodeforcesRound#264(Div.2)_html/css_WEB-ITnose

Codeforces Round #264 (Div. 2)

代码：

A：

#include  #include  #include using namespace std;int n, s;int main() {	scanf("%d%d", &n, &s);	int x, y;	int flag = 1;	int ans = 0;	for (int i = 0; i  

B：

#include  #include  const int N = 100005;typedef long long ll;int n;ll h[N];int main() {	scanf("%d", &n);	for (int i = 1; i   h[i - 1]) {			ll need = h[i] - h[i - 1];			if (now >= need) {				now -= need;			} else {				ans += need - now;				now = 0;			}		} else {			now += h[i - 1] - h[i];		}	}	printf("%lld\n", ans);	return 0;} 

C：

#include  #include  const int N = 2005;typedef long long ll;int n;ll g[N][N], zhu[N + N], fu[N + N];int main() {	scanf("%d", &n);	for (int i = 0; i  

D：

#include  #include  #include using namespace std;const int N = 1005;struct Num {	int v[10], la;} num[N];bool cmp(Num a, Num b) {	return a.la  

E：

#include  #include  #include  using namespace std;const int N = 100005;int n, q, val[N], f[N];vector  g[N];void dfs(int u, int fa) {	f[u] = fa;	for (int i = 0; i   1) return u;		u = f[u];	}	return -1;}int main() {	scanf("%d%d", &n, &q);	for (int i = 1; i  

查看更多关于CodeforcesRound#264(Div.2)_html/css_WEB-ITnose的详细内容...