Flipping Game
来源:互联网 发布:openwrt修改wan口mac 编辑:程序博客网 时间:2024/05/20 18:17
Iahub got bored, so he invented a game to be played on paper.
He writes n integers a1, a2, ..., an. Each of those integers can be either 0 or 1. He's allowed to do exactly one move: he chooses two indices i and j (1 ≤ i ≤ j ≤ n) and flips all values ak for which their positions are in range [i, j] (that is i ≤ k ≤ j). Flip the value of x means to apply operation x = 1 - x.
The goal of the game is that after exactly one move to obtain the maximum number of ones. Write a program to solve the little game of Iahub.
The first line of the input contains an integer n (1 ≤ n ≤ 100). In the second line of the input there are n integers: a1, a2, ..., an. It is guaranteed that each of those n values is either 0 or 1.
Print an integer — the maximal number of 1s that can be obtained after exactly one move.
51 0 0 1 0
4
41 0 0 1
4
In the first case, flip the segment from 2 to 5 (i = 2, j = 5). That flip changes the sequence, it becomes: [1 1 1 0 1]. So, it contains four ones. There is no way to make the whole sequence equal to [1 1 1 1 1].
In the second case, flipping only the second and the third element (i = 2, j = 3) will turn all numbers into 1.
一些01,改变一个区间,然后把这个区间内1变为0,0变为1,求变化后1的最大个数(必须修改一个数)。一个简单的动规,只需要判断这个数字能最大改变多少1的个数。
if(a[i]==0)dp[i]=max(0,dp[i-1]+1);
if(a[i]==1)dp[i]=max(0,dp[i-1]-1);
然后注意如果全是1的话,这个通项出来的是n,然而题目要求至少改变一个数,所以这个情况就是n-1。特判。
#include<cstdio>#include<cstring>#include<iostream>using namespace std;int dp[105], a[105];int max(int a, int b){return a > b ? a : b;}int main(){int n, i, j, m, ans, pre;cin >> n;pre = 0;for (i = 1; i <= n; i++){cin >> a[i];if (a[i] == 1)pre++;}if (a[1] == 0)dp[1] = 1;else dp[1] = 0;for (i = 2; i <= n; i++){if (a[i] == 1)dp[i] = max(dp[i - 1] - 1, 0);else if (a[i] == 0)dp[i] = max(0, dp[i - 1] + 1);}ans = dp[1];for (i = 2; i <= n; i++)ans = max(ans, dp[i]);if (ans == 0)cout << pre - 1 << endl;elsecout << pre + ans << endl;return 0;}
- Flipping Game
- Flipping Game
- CF:A. Flipping Game
- A. Flipping Game
- codeforces Flipping Game 题解
- Flipping Game(枚举)
- CF 327A - Flipping Game
- CF 327 A Flipping Game
- CF 327A Flipping Game
- codeforces 327A. Flipping Game
- Codeforces - 327A - Flipping Game
- Flipping Game(Codeforces)(枚举)
- [CodeForces327A]Flipping Game[dp][暴力]
- CodeForces-327A Flipping Game
- Codeforces 327A Flipping Game
- codeforces 327A. Flipping Game
- CodeForces 327A Flipping Game
- Codeforces-327A-Flipping Game
- 23种常用的设计模式介绍
- 构造函数为什么不能是虚函数
- Apktool回编译问题解决方案总结
- 面试算法java方式实现打印金字塔三角形
- nogotofail 安装测试
- Flipping Game
- 多选框CheckBox的使用
- 慕课网HTML5学习笔记
- 第六题
- java_类排序模板(类似于C++结构体)
- android顺序广播
- 微信支付后台需要做的事情 ,以及遇到的一些问题
- Android模拟器与局域网通信
- Java基础—GUI