Subsequence Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 5716 Accepted Submission(s): 1884 Problem Description There is a sequence of integers. Your task is to find the longest subsequenc…
题目连接:http://acm.hdu.edu.cn/showproblem.php?pid=2490 Parade Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 902 Accepted Submission(s): 396 Problem Description Panagola, The Lord of city F lik…
多重背包二进制优化终于写了一次,注意j的边界条件啊,疯狂RE(还是自己太菜了啊啊)最辣的辣鸡 #include<bits/stdc++.h> using namespace std; int n,sum; ; ; ; const int inf=0x3f3f3f3f; int w[N*C],idx,num[N*C]; int b[N],c[N]; //面值 个数 int f[K],k; int main(){ scanf("%d",&n); ;i<=n;i++…
题目大意:给你n个数, 让你问你最长的满足要求的区间有多长,区间要求:MAX - MIN >= m && MAX - MIN <= k 思路:单调队列维护递增和递减,在加入数值的过程中更新答案. #include<bits/stdc++.h> #define LL long long #define fi first #define se second #define mk make_pair #define pii pair<int,int> #def…
Trade Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2918 Accepted Submission(s): 930 Problem Description Recently, lxhgww is addicted to stock, he finds some regular patterns after a few d…