K Balanced Teams

https://codeforces.com/contest/1133/problem/E

题解：DP

/*
*@Author:   STZG
*@Language: C++
*/
#include <bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<string>
#include<vector>
#include<bitset>
#include<queue>
#include<deque>
#include<stack>
#include<cmath>
#include<list>
#include<map>
#include<set>
//#define DEBUG
#define RI register int
using namespace std;
typedef long long ll;
//typedef __int128 lll;
const int N=5000+10;
const int M=100000+10;
const int MOD=1e9+7;
const double PI = acos(-1.0);
const double EXP = 1E-8;
const int INF = 0x3f3f3f3f;
int t,n,m,k,q;
int ans,cnt,flag,temp,sum;
int a[N];
char str;int maxl[N];
int dp[N][N];
int main()
{
#ifdef DEBUGfreopen("input.in", "r", stdin);//freopen("output.out", "w", stdout);
#endif//ios::sync_with_stdio(false);//cin.tie(0);//cout.tie(0);//scanf("%d",&t);//while(t--){scanf("%d%d",&n,&k);for(int i=1;i<=n;i++){scanf("%d",&a[i]);}sort(a+1,a+n+1);int L=1;int R=1;while(L<=R&&R<=n){if(a[R]-a[L]<=5){maxl[R]=R-L+1;R++;}else{L++;}}for(int i=1;i<=n;i++){dp[1][i]=max(dp[1][i-1],maxl[i]);}if(dp[1][n] + k >= n){cout << n << endl;return 0;}for(int i=2;i<=k;i++){for(int j=1;j<=n;j++){for(int l=1;l<=maxl[j];l++){dp[i][j] = max(dp[i][j-1],max(dp[i][j],dp[i-1][j-l]+l));if(dp[i][j]>=n){cout << n << endl;return 0;}}}}for(int i=1;i<=k;i++){ans=max(dp[i][n],ans);}cout<<ans<<endl;//}#ifdef DEBUGprintf("Time cost : %lf s\n",(double)clock()/CLOCKS_PER_SEC);
#endif//cout << "Hello world!" << endl;return 0;
}

K Balanced Teams相关推荐

Codeforces-868C - Qualification Rounds - 思维
链接: http://codeforces.com/contest/868/problem/C 题目: Snark and Philip are preparing the problemset ...
GB_T28181-2016.pdf
国标28181-2016版本检测,由于文件过大,而且博客不支持上传文件,需要GB28181-2016协议文档和公安一所检测文档的可以私信我,QQ:123011785 I C S1 3. 3 1 0 A ...
poj3264 - Balanced Lineup（RMQ_ST）
Balanced Lineup Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 45243 Accepted: 21240 ...
POJ 3264 Balanced Lineup
Balanced Lineup Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 53629 Accepted: 25223 ...
HDOJ 3709 Balanced Number
数位DP... Balanced Number Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65535/65535 K (Java ...
Gold Balanced Lineup - poj 3274 (hash)
这题,看到别人的解题报告做出来的,分析: 大概意思就是: 数组sum[i][j]表示从第1到第i头cow属性j的出现次数. 所以题目要求等价为: 求满足 sum[i][0]-sum[j][0]=sum ...
poj 3264 Balanced Lineup RMQ问题线段树
For the daily milking, Farmer John's N cows (1 ≤ N ≤ 50,000) always line up in the same order. One d ...
SBT模版(Size Balanced Tree)
关于SBT的介绍及学习,请戳这里. SBT模版: /************************************************* 数据结构: SBT(Size Balanced ...
1702: [Usaco2007 Mar]Gold Balanced Lineup 平衡的队列
1702: [Usaco2007 Mar]Gold Balanced Lineup 平衡的队列 Time Limit: 5 Sec Memory Limit: 64 MB Submit: 510 ...

K Balanced Teams

K Balanced Teams相关推荐

最新文章

热门文章