C++博客-syhd142-最新评论http://www.cppblog.com/syhd142/CommentsRSS.aspxzh-cnWed, 24 Aug 2011 14:49:06 GMTWed, 24 Aug 2011 14:49:06 GMTcnblogsre: 如何Emacs显示行号和括号匹配http://www.cppblog.com/syhd142/archive/2011/08/25/130890.html#154354bqdxbqdxThu, 25 Aug 2011 09:42:00 GMThttp://www.cppblog.com/syhd142/archive/2011/08/25/130890.html#154354括号匹配那个功能很赞

bqdx 2011-08-25 17:42 发表评论
]]>re: HDU 1494 跑跑卡丁车http://www.cppblog.com/syhd142/archive/2011/08/16/126271.html#153578FuckerFuckerTue, 16 Aug 2011 09:31:00 GMThttp://www.cppblog.com/syhd142/archive/2011/08/16/126271.html#153578

Fucker 2011-08-16 17:31 发表评论
]]>re: HDU 1494 跑跑卡丁车http://www.cppblog.com/syhd142/archive/2011/08/16/126271.html#153574boychao@163.comboychao@163.comTue, 16 Aug 2011 09:13:00 GMThttp://www.cppblog.com/syhd142/archive/2011/08/16/126271.html#153574

boychao@163.com 2011-08-16 17:13 发表评论
]]>re: HDU 1059 Dividinghttp://www.cppblog.com/syhd142/archive/2011/08/02/121289.html#152303songzhongpingsongzhongpingTue, 02 Aug 2011 10:57:00 GMThttp://www.cppblog.com/syhd142/archive/2011/08/02/121289.html#152303#include <stdio.h>
#include <iostream>


using namespace std;
int f[60005];
#define MAX(a,b) a>b?a:b
void Complete(int cost, int weight, int m)
{
for(int i = cost; i <= m; i++)
f[i] = MAX(f[i], f[i - cost] + weight);
}
void Zero_One(int cost, int weight, int m)
{
for(int i = m; i >= cost; i--)
f[i] = MAX(f[i], f[i - cost] + weight);
}

int main(int argc, char *argv[])
{
int a[7],n,i,j,sum,t=0;
while(1)
{
sum=0;

for(i=1;i<7;i++)
{
scanf("%d",a+i);
sum+=a[i]*i;
}
if(!sum) break;
if(sum&1)
{ printf("Collection #%d:\n",++t);
puts("Can't be divided.\n");
continue;
}
sum >>= 1;
memset(f,0,sizeof(f));
for(i=1;i<7;i++)
{
if(a[i]*i>=sum)
{
Complete(i,i,sum);
}
else if(a[i]>0)
{
int k=1;
while(k<a[i])
{
Zero_One(k*i,k*i,sum) ;
a[i]-=k;
k <<= 1;
}
for(j=sum;j>=i*a[i];j--)
{
Zero_One(a[i]*i,a[i]*i,sum);
}
}
}

if(f[sum]==sum)
{
printf("Collection #%d:\n",++t);
puts("Can be divided.\n");

}
else
{printf("Collection #%d:\n",++t);
puts("Can't be divided.\n");

}

}
// system("PAUSE");
return EXIT_SUCCESS;
}
//这是我的代码为什么总是超时呢？求解释。。

songzhongping 2011-08-02 18:57 发表评论
]]>re: HDU 2896 病毒侵袭http://www.cppblog.com/syhd142/archive/2011/05/14/138223.html#146361小尼人00小尼人00Sat, 14 May 2011 05:04:00 GMThttp://www.cppblog.com/syhd142/archive/2011/05/14/138223.html#146361#include <string.h>
#include <math.h>
#include <vector>
#include <iostream>
#include <set>
#include <algorithm>
#include <queue>
using namespace std;

#define kind 129
#define M 10010

struct node {
node *fail;
node *next[kind];
int id;
node() { //构造函数
fail = NULL;
id = 0;
memset(next, NULL, sizeof(next));
}
};

char ch[M]; //键盘输入的串
queue<node *> q;
set <int> g;
int n, m;

void insert(node *root, char *str, int num) {
node *p = root;
int i = 0, index;
while(str[i]) {
index = str[i] - 'a';
if(p->next[index] == NULL) {
p->next[index] = new node();
}
p = p->next[index];
i++;
}
p->id = num;
}

void AC (node *&root) { ///root -> fail = NULL;
q.push(root);
while(!q.empty()) {
node *p = NULL;
node *t = q.front();
q.pop();
for(int i = 0; i < kind; i++) {

if(t->next[i]) {

p = t->fail;

while(p) {
if(p->next[i]) {
t->next[i]->fail = p->next[i];
break;
}
p = p->fail;
}
if(!p) t->next[i]->fail = NULL;
q.push(t->next[i]);
}
}
}
}

bool query(node *&root, char *str, int ca) {
g.clear();
int i = 0, t, flag = 0;
node *p = root, *tmp;
while(str[i]) {
t = str[i] - 'a';
while(!p->next[t] && p != root) { p = p->fail; }
///*****************************///
p = p->next[t];
///******************************///
if(!p) p = root;
tmp = p;
while(tmp != root && tmp->id) {
flag = 1;
g.insert(tmp->id);
tmp = tmp->fail;
}
i++;
}
if(!flag) return false;
printf("web %d:", ca);
for(set<int>::iterator it = g.begin(); it != g.end(); it++) {
cout << ' ' << *it;
}
cout << endl;
return true;
}

int main() {
int total;
while(~scanf("%d", &n)) {
node *root = new node();
total = 0;
for(int i = 0; i < n; i++) {
scanf("%s", ch);
insert(root, ch, i+1);
}
AC(root);
cin >> n;
for(int i = 0; i < n; i++) {
cin >> ch;
if(query(root, ch, i+1)); total++;
}
printf("total: %d\n", total);
}
return 0;
}








帮忙看看吧！楼主，照你的写的，但是还是不行，输入都不行

小尼人00 2011-05-14 13:04 发表评论
]]>re: UVA 624 CDhttp://www.cppblog.com/syhd142/archive/2011/03/31/118968.html#143110FuckerFuckerThu, 31 Mar 2011 06:32:00 GMThttp://www.cppblog.com/syhd142/archive/2011/03/31/118968.html#143110额，有点遥远了，都忘记了。

Fucker 2011-03-31 14:32 发表评论
]]>re: UVA 624 CDhttp://www.cppblog.com/syhd142/archive/2011/03/31/118968.html#143105alienalienThu, 31 Mar 2011 05:57:00 GMThttp://www.cppblog.com/syhd142/archive/2011/03/31/118968.html#14310545 8 4 10 44 43 12 9 8 2
这组我用你的程序计算出来的是43 2 sum:45.
应该是4 10 12 9 8 2 sum:45
为什么可以这样记录路径？

alien 2011-03-31 13:57 发表评论
]]>re: UVA 11594 All Pairs Maximum Flowhttp://www.cppblog.com/syhd142/archive/2011/02/12/119887.html#139929ZiwenZiwenSat, 12 Feb 2011 03:29:00 GMThttp://www.cppblog.com/syhd142/archive/2011/02/12/119887.html#139929THX
Very Simple Methods for All Pairs Network Flow Analysis
caocao9926@163.com

Ziwen 2011-02-12 11:29 发表评论
]]>re: UVA 10003 Cutting Stickshttp://www.cppblog.com/syhd142/archive/2010/11/17/118133.html#133879jerrymu1234jerrymu1234Wed, 17 Nov 2010 06:01:00 GMThttp://www.cppblog.com/syhd142/archive/2010/11/17/118133.html#133879
如何在求minimum cost值的同时，
记录所cut的点的次序??被困扰好久。。。。。

比如input:
10 (木棍长)
3 （切3次）
2 4 7 （在2，4，7处切）
Output:
The minimum cost is 20.
The optimal cutting sequence: 4,2,7

jerrymu1234 2010-11-17 14:01 发表评论
]]>re: UVA 10819 Trouble of 13-Dotshttp://www.cppblog.com/syhd142/archive/2010/11/14/118985.html#133560FuckerFuckerSat, 13 Nov 2010 16:26:00 GMThttp://www.cppblog.com/syhd142/archive/2010/11/14/118985.html#133560背包九讲里面貌似有说。

Fucker 2010-11-14 00:26 发表评论
]]>