ZOJ - 3932 Handshakes 【水】

【ZOJ - 3932 Handshakes 【水】】的更多相关文章

ZOJ - 3932 Handshakes 【水】

题目链接 http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=3932 题意给出 N 个人,然后 1-N 然后从 1 - N 一个一个的进,每个人进去都可以在在座的人握手,然后给出那个人握手的次数要求出握手次数的最大值思路只要进来的人握手次数>=1 那么本来已经在区域内的人那个当前这个人的握手次数就是其给出的握手次数,本来已经在区域内的人握手次数都+1,因为都是有可能的然后实际发现 ,可以FOR 一遍…

ZOJ 3932 Handshakes

Last week, n students participated in the annual programming contest of Marjar University. Students are labeled from 1 to n. They came to the competition area one by one, one after another in the increasing order of their label. Each of them went in,…

ZOJ 3923 Handshakes

水题. 算一下每个人和之前的人握手次数+之后的人和这个人握手次数.取最大值. #include<cstdio> #include<cstring> #include<cmath> #include<algorithm> using namespace std; +; int n; int a[maxn],dp[maxn]; int main() { int T; scanf("%d",&T); while(T--) { scanf…

ZOJ 3594 年份水题【注意：没有0年】

#include<iostream> #include<cstdio> #include<cstring> #include<algorithm> #include<stdio.h> #include<string.h> using namespace std; int main(){ ][] = {"Jia", "Yi", "Bing", "Ding",…

zoj 3809 枚举水题（2014牡丹江网赛 A题）

题目大意:给出一列取样的几个山的高度点,求山峰有几个? Sample Input 291 3 2 4 6 3 2 3 151 2 3 4 5Sample Output 30 # include <iostream> # include <cstdio> # include <cstring> # include <algorithm> # include <cmath> # define LL long long using namespace…

ZOJ 3932 Deque and Balls

There are n balls, where the i-th ball is labeled as pi. You are going to put n balls into a deque. In the i-th turn, you need to put the i-th ball to the deque. Each ball will be put to both ends of the deque with equal probability. Let the sequence…