05 2014 档案

摘要:用二维数组写了好久,失败啊。。#include#include#include#includeusing namespace std;int n,m;int dp[110][110][110];char st[110][12];int s[110],an[110],as[110];int conve... 阅读全文
posted @ 2014-05-28 21:21 JarvisLau 阅读(121) 评论(0) 推荐(0)
摘要:其实不算难的一道题,但憋了我好久,嗯,很爽。#include#include#include#includeusing namespace std;int n;int a[5010],dp[5010],s[5010];void solve(){ s[0]=1; int maxn=0; ... 阅读全文
posted @ 2014-05-28 21:16 JarvisLau 阅读(221) 评论(0) 推荐(0)
摘要:#include#include#includelong long num[100010];using namespace std;struct st{ int l; int r; long long sum; long long a;} p[400100];void bu... 阅读全文
posted @ 2014-05-20 14:21 JarvisLau 阅读(127) 评论(0) 推荐(0)
摘要:算是水题一道吧,我也没有建树,看别人又用vector,又用bfs,dfs的,对vector不熟,所以就模拟了一下#include#include#includeusing namespace std;int a[100005];int main(){ int t;cin>>t; whil... 阅读全文
posted @ 2014-05-07 06:33 JarvisLau 阅读(132) 评论(0) 推荐(0)
摘要:暴力#include#include#includeusing namespace std;int main(){ int t=0,i=0; char s[10][12]; bool a[12][12]; memset(s,'\0',sizeof(s)); while(... 阅读全文
posted @ 2014-05-05 20:36 JarvisLau 阅读(171) 评论(0) 推荐(0)