模拟
wangfy_
这个作者很懒,什么都没留下…
展开
-
1007 Maximum Subsequence Sum (25)
Maximum Subsequence Sum. Given a sequence of K integers { N1, N2, ..., NK }. A continuous subsequence is defined to be { Ni, Ni+1, ..., Nj } where 1 <= i <= j <= K. The Maximum Subsequence...原创 2018-06-03 21:32:53 · 177 阅读 · 0 评论 -
1008 Elevator (20)
#include <cstdio> int main() { int N, s = 0, c = 0; scanf("%d",&N); for(int i=0; i<N; i++) { int t; scanf("%d",&t); if(c > t) s += 4 * (c - t); if(c < t) s += 6 * (t ...原创 2018-06-04 23:19:52 · 145 阅读 · 0 评论 -
1009 Product of Polynomials (25)
Product of Polynomials(多项式的积). This time, you are supposed to find A*B where A and B are two polynomials. Input Specification: Each input file contains one test case. Each case occupies 2 lines, an...原创 2018-06-06 10:31:33 · 148 阅读 · 0 评论 -
1006 Sign In and Sign Out (25)
Sign In and Sign Out At the beginning of every day, the first person who signs in the computer room will unlock(开锁) the door, and the last one who signs out will lock the door. Given the records of ...原创 2018-06-01 22:02:58 · 173 阅读 · 0 评论 -
1011 World Cup Betting (20)
(待)原创 2018-06-10 08:37:08 · 142 阅读 · 0 评论 -
1012 The Best Rank (25)
(待)原创 2018-06-10 08:37:41 · 197 阅读 · 0 评论 -
1017 Queueing at Bank (25)
#include <cstdio> #include <iostream> #include <algorithm> using namespace std; const int MAXN = 10010; struct customer { int arriveTime; int processTime; } Customer[MAXN]; s...原创 2018-06-25 18:01:29 · 146 阅读 · 0 评论