浪遏飞舟

摘要： 链接 http://acm.hdu.edu.cn/showproblem.php?pid=2196#include<iostream>#include<stdio.h>#include<cstring>#include<algorithm>using namespace std;struct date{ long long len,Max,v,next;}edge[111234];long long head[111234],total,dp[111234];bool vis[111234];inline long long max( long 阅读全文

摘要： 链接 http://icpc.njust.edu.cn/Contest/194/Problem/C#include<iostream>#include<stdio.h>#include<algorithm>#include<cstring>#include<cmath>using namespace std;long long pow( int num ){ long long res = 1; for( int i = 1; i <= num; i++ ) res *= 2; return res;}long long max 阅读全文