Codeforces Round #726 (Div. 2)(贪心专题)
A. Arithmetic Array
分析:贪心,sum 和 n 进行比较。
int main()
{
int t;
cin>>t;
while(t--)
{
int sum = 0;
cin>>n;
rep(i,1,n)
{
cin>>a[i];
sum+=a[i];
}
if(sum>=n)
{
cout<<sum-n<<endl;
}
else cout<<"1"<<endl;
}
return 0;
}
B. Bad Boy
分析:贪心,走到最远的两个角即可。
int main()
{
int t;
cin>>t;
while(t--)
{
int n,m,x,y;
cin>>n>>m>>x>>y;
if(x > n/2) x = 1;
else x = n;
if(y > m/2) y = 1;
else y = m;
int i,j;
i = x==1?n:1;
j = y==1?m:1;
cout<<x<<" "<<y<<" "<<i<<" "<<j<<endl;
}
return 0;
}
C. Challenging Cliffs
分析:先将山高度从小到大排序,将两个高度差最小的山安排在两边,然后剩下的山按先排比最右边山高的山升序、比最左面山高的山序列升序排序,为最优解。
int main()
{
int t;
cin>>t;
while(t--)
{
int n;
cin>>n;
rep(i,1,n)
{
cin>>a[i];
}
sort(a+1,a+1+n);
int x = n;
for(int i = n; x>=2&&i>=2; i--)
{
if(a[x]-a[x-1] >= a[i]-a[i-1]) x = i;
}
swap(a[x],a[x-1]);
// rep(i,1,n)
// {
// cout<<a[i]<<" ";
// }cout<<endl;
//cout<<x<<endl;
int cnt = 1;
rep(i,x,n)
{
b[cnt++] = a[i];
}
rep(i,1,x-1)
{
b[cnt++] = a[i];
}
//cout<<cnt<<endl;
rep(i,1,n)
{
cout<<b[i]<<" ";
}
cout<<endl;
}
return 0;
}
D. Deleting Divisors
分析:
1.奇数先手必败
2.偶数,不是2次幂,先手必赢
3.偶数,数2次幂,看是多少次方,奇数后手必赢,偶数先手必赢
int main()
{
int t;
cin>>t;
while(t--)
{
int n;
cin>>n;
int cnt = 0;
while(n%2 == 0)
{
n/=2;
cnt++;
}
if(cnt == 0)cout<<"Bob"<<endl;
else if(cnt == 1 && n == 1)cout<<"Bob"<<endl;
else if(n>1)cout<<"Alice"<<endl;
else if((cnt&1) <= 0)cout<<"Alice"<<endl;
else cout<<"Bob"<<endl;
}
return 0;
}
E1. Erase and Extend (Easy Version)
int main()
{
// int t;
// cin>>t;
// while(t--)
// {
int n,k;
cin>>n>>k;
cin>>s;
rep(i,1,n)
{
int cnt = k/i+(k%i!=0);
rep(j,1,cnt)
{
rep(l,1,i)
{
t[i*j+l] = s[l];
}
}
t[k] = '\0';
if(i>1)
{
if(cmp())strcpy(ans,t);
}
else strcpy(ans,t);
}
cout<<ans<<endl;
// }
return 0;
}