06 2015 档案

HDU 4221 Greedy?（贪心）
摘要：题意：思路：#include#include#include#include#include#include#include#include#includeusing namespace std;struct Work{ __int64 c,d;};Work work[100000+10];i... 阅读全文
posted @ 2015-06-10 05:03 sola94 阅读(154) 评论(0) 推荐(0)
HDU 4223 Dynamic Programming?(dp)
摘要：题意：思路：#include#include#include#include#includeusing namespace std;int a[200];int dp1[1000+10];int dp2[1000+10];int main(){ int t,n; int i,j,k; ... 阅读全文
posted @ 2015-06-10 05:02 sola94 阅读(179) 评论(0) 推荐(0)
HDU 4584 Building bridges
摘要：题意：思路：#include#include#include#include#include#include#include#include#includeusing namespace std;const int MAXN=2000+5;const int MAX=50+5;const int I... 阅读全文
posted @ 2015-06-04 20:15 sola94 阅读(137) 评论(0) 推荐(0)
HDU 4585 Shaolin （map）
摘要：题意：思路：#include#include#include#include#include#include#include#include#include#includeusing namespace std;map a;const int INF=1000000000;int main(){ ... 阅读全文
posted @ 2015-06-04 20:11 sola94 阅读(123) 评论(0) 推荐(0)
HDU 4576 Robot （概率DP）
摘要：题意：思路：#include#include#include#includeusing namespace std;double dp[3][300];int main(){ int n,m; int l,r; int i,j,k; double ans; int te... 阅读全文
posted @ 2015-06-04 20:09 sola94 阅读(119) 评论(0) 推荐(0)
HDU 4499 Cannon
摘要：题意：思路：#include#include#include#include#include#include#include#include#includeusing namespace std;const int MAXN=10+5;int n,m,Q,ans;int mat[MAXN][MAXN... 阅读全文
posted @ 2015-06-04 20:07 sola94 阅读(134) 评论(0) 推荐(0)
hdu 4496 D-City（并查集）
摘要：题意：思路：#include#include#include#include#include#include#includeusing namespace std;const int MAXN=100000+5;int p[MAXN],u[MAXN],v[MAXN],vis[MAXN],w[MAXN... 阅读全文
posted @ 2015-06-04 20:04 sola94 阅读(147) 评论(0) 推荐(0)
hdu 4493 Tutor （水 精度）
摘要：题意：思路：#include #include #include #include using namespace std;int fa[150];int fin(int x){ return fa[x]==x?x:fin(fa[x]);}void unionn(int x,int y){ ... 阅读全文
posted @ 2015-06-04 20:03 sola94 阅读(135) 评论(0) 推荐(0)