CCSU_Seth

背包变种 dp[j]表示不被抓的概率#include#include#define maxn 109#includeusing namespace std;int money[maxn];float caught[maxn],dp[maxn*maxn];int main(){ int T,banks; float limits; scanf("%d",&

http://acm.hdu.edu.cn/showproblem.php?pid=3466#include#include#include#includeusing namespace std;struct item{ int p,q,v; bool operator < (const item it ) const{ return q-p < it.q-it.

#include#include#define maxn 1001using namespace std;int stack[maxn],N;int main(){ scanf("%d",&N); int top=0; stack[0]=-1; for(int i=0;i<N;i++) { int temp;

#include#include#define maxn 1001using namespace std;int N;//数据个数int a[maxn];//储存数据int dp[maxn];//dp[i]表示以i结束的最长上升子序列的最大长度 初始为1int main(){ while(~scanf("%d",&N)) { for(int i=1