Zhengggggg的博客

Bone CollectorTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 76935    Accepted Submission(s): 31880Problem DescriptionMany years ago , in Teddy...

题意：给你n个si和fi，要求在Ts，Tf为正数的情况下Ts+Tf的最大值。题解：因为每一个只有两个选择取和不取，所以很容易看出是01背包，但是要注意的是它有负数的情况，所以要把整个坐标轴左移。#include <stdio.h>#include <string.h>#include <iostream>#include <iostream...