题面 题意很简单 A l i c e \tt Alice Alice 和 B o b \tt Bob Bob 在博弈.摆在他们面前有 N \rm N N 个区间 [ l i , r i ) \rm[l_i,r_i) [li,ri) ,每人轮流取出一个区间,放到数轴上,要求取出的区间与当前数轴上的任意区间交集为 ∅ \rm\empty ∅ . A l i c e \tt Alice Alice 先手. T ( 1 ≤ T ≤ 20 ) \rm T(1\leq T\leq20) T(1≤T≤20
Father Christmas flymouse Time Limit: 1000MS Memory Limit: 131072K Total Submissions: 3241 Accepted: 1099 Description After retirement as contestant from WHU ACM Team, flymouse volunteered to do the odds and ends such as cleaning out the computer
Perfect Service Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 1518 Accepted: 733 Description A network is composed of N computers connected by N − 1 communication links such that any two computers can be communicated via a unique rou
题意:有 k 个人需要买电影票,a[i] 表示第 i 个人单独买票要花费的时间,b[i] 表示第 i-1 个和第 i 个人一起买票需要花费的时间,问卖给所有人各一张票最少需要到什么时候. dp[i]表示卖完第 i 个人需要花费的最短时间 dp[i]=min(dp[i-1]+a[i],dp[i-2]+b[i]); 初始化:dp[0]=0;dp[1]=a[1]; #include<stdio.h> #include<string.h> ; int a[maxn],b[maxn]; in