Codeforces Round #507 (Div. 2, based on Olympiad of Metropolises) B. Shashlik Cooking

problem link:http://codeforces.com/contest/1040/problem/B
题意：给你一个n代表有n个初始状态为正面的羊肉串，k代表你每次可以随机选择一个数值i，并把第 i-k 到第 i+k 个羊肉串翻过来。问你最少需要多少次可以把所有羊肉串全部翻过来。
解题报告：经过观察发现，当k==0时，那就需要翻n次了，当n<=(2*k)+1时，肯定翻中间那个翻一次就可以啦。其他的就是观察n%(2*k+1)与k的关系来确定从哪里开始翻。画画就明白了。我觉得我的代码还算一般短。所以就没看别人的代码，等下我去瞅瞅。
AC code:

#include<iostream>
using namespace std;
const int N=1e3+5;
int n,k,a[N],cnt;
int main(){ios::sync_with_stdio(false);cin.tie(0);cin>>n>>k;if(!k){cnt=n;for(int i=1;i<=n;i++)a[i]=i;}else if(n<=(2*k+1)){cnt=1;a[1]=n/2+1;}else if(n>(2*k+1)){if(n%(2*k+1)>k||!(n%(2*k+1))){cnt=0;for(int i=k+1;i<=n;i+=(2*k+1))a[++cnt]=i;}else {cnt=0;for(int i=1;i<=n;i+=(2*k+1))a[++cnt]=i;}}cout<<cnt<<endl;for(int i=1;i<=cnt;i++)cout<<a[i]<<" ";
}

Codeforces Round #507 (Div. 2, based on Olympiad of Metropolises) B. Shashlik Cooking相关推荐

【Codeforces Round #507 (Div. 2, based on Olympiad of Metropolises) A】Palindrome Dance
[链接] 我是链接,点我呀:) [题意] 在这里输入题意 [题解] i从1..n/2循环一波. 保证a[i]和a[n-i+1]就好. 如果都是2的话填上min(a,b)*2就好其他情况跟随非2的. ...
【Codeforces Round #507 (Div. 2, based on Olympiad of Metropolises) B】Shashlik Cooking
[链接] 我是链接,点我呀:) [题意] 在这里输入题意 [题解] 翻转一次最多影响2k+1个地方. 如果n<=k+1 那么放在1的位置就ok.因为能覆盖1..k+1 如果n<=2k+1 ...
Codeforces Round #433 (Div. 2, based on Olympiad of Metropolises)
A. Fraction 题目链接:http://codeforces.com/contest/854/problem/A 题目意思:给出一个数n,求两个数a+b=n,且a/b不可约分,如果存在多组满足 ...
Codeforces Round #507 (Div. 1) D. You Are Given a Tree 根号分治 + dp
传送门题意: 有一颗nnn个节点的树,其中一个简单路径集合被称为kkk合法当且仅当: 树的每个节点至多属于一条路径,且每条路径恰好包含kkk个点. 对于k∈[1,n]k\in [1,n]k∈[1,n ...
C. Tyler and Strings（组合数学,树状数组维护前缀和）(Codeforces Round #775 (Div. 1, based on Moscow Open Olympiad i)
对我来说比较困难的一题了,尝试着自己写了一下,调不出来遂放弃. Codeforces Round #775 (Div. 1, based on Moscow Open Olympiad in Info ...
Codeforces Round #775 (Div. 2, based on Moscow Open Olympiad in Informatics）简训
Codeforces Round #775 (Div. 2, based on Moscow Open Olympiad in Informatics)简训导语涉及的知识点题目 A Game B ...
Codeforces Round #740 (Div. 2, based on VK Cup 2021 - Final (Engine))
Codeforces Round #740 (Div. 2, based on VK Cup 2021 - Final (Engine)) 题号题目知识点 A Simply Strange Sor ...
Codeforces Round #740 (Div. 2, based on VK Cup 2021 - Final (Engine)) A-F全题解
Codeforces Round #740 (Div. 2, based on VK Cup 2021 - Final (Engine)) 文章目录 A. Simply Strange Sort B. ...
Codeforces Round #583 (Div. 1 + Div. 2, based on Olympiad of Metropolises)
枚举题意,五十分钟看懂题,十分钟过三道,tarjan还写挂了,大型翻车现场. A.你有n卢布,要把卢布换成美元和欧元,一美元和一欧元对应的卢布数是给定的美元有几种面值:1.2.5.10.20.50. ...
Codeforces Round #626 (Div. 2, based on Moscow Open Olympiad in Informatics)C. Unusual Competitions
C. Unusual Competitions time limit per test1 second memory limit per test512 megabytes inputstandard ...

Codeforces Round #507 (Div. 2, based on Olympiad of Metropolises) B. Shashlik Cooking

Codeforces Round #507 (Div. 2, based on Olympiad of Metropolises) B. Shashlik Cooking相关推荐

最新文章

热门文章