The waste of the remark, every question has been waded.
4376. Counting Circles 【Analog】
#include<bits/stdc++.h>
using namespace std;
string a="0469AD";
string b="8B";
char get(int x)
{
if(x<10) return '0'+x;
else return 'A'+x-10;
}
int main(void)
{
int n; cin>>n;
if(n==0)
{
puts("1");
return 0;
}else
{
int cnt=0;
while(n)
{
char c=get(n%16);
if(a.find(c)!=-1) cnt+=1;
else if(b.find(c)!=-1) cnt+=2;
n/=16;
}
cout<<cnt;
}
}
4377. Farmland Irrigation【Sort】
#include<bits/stdc++.h>
using namespace std;
const int N=1e5*2+10;
int n,m,t,a[N];
int main(void)
{
cin>>t;
while(t--)
{
scanf("%d%d",&n,&m);
for(int i=0;i<m;i++) scanf("%d",&a[i]);
sort(a,a+m);
vector<int>ans;
for(int i=0;i<m;i++)
{
if(!i) ans.push_back(a[i]);
if(i==m-1) ans.push_back(n-a[i]+1);
if(i-1>=0) ans.push_back((a[i]-a[i-1])/2+1);
}
sort(ans.begin(),ans.end());
cout<<ans[ans.size()-1]<<endl;
}
return 0;
}
4378. Select a pair [DP]
The meaning of the question is to select k intervals of length m to maximize the sum of the interval of length n.
f[i][j]表示考虑前i长度 选j个m个长度的区间
#include<bits/stdc++.h>
using namespace std;
const int N=5010;
typedef long long int LL;
LL f[N][N],a[N],s[N],n,m,k;
int main(void)
{
cin>>n>>m>>k;
for(int i=1;i<=n;i++) cin>>a[i],s[i]=s[i-1]+a[i];
for(int i=m;i<=n;i++)
for(int j=1;j<=k;j++)
f[i][j]=max(f[i-1][j],f[i-m][j-1]+s[i]-s[i-m]);
cout<<f[n][k];
}