codeforces 327A
来源:互联网 发布:linux启动ntp服务命令 编辑:程序博客网 时间:2024/06/10 13:36
Description
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 xmeans 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.
Input
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.
Output
Print an integer — the maximal number of 1s that can be obtained after exactly one move.
Sample Input
51 0 0 1 0
4
41 0 0 1
4
Hint
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.
题意:N张牌, 每张牌是0或1, 让你随意找区间,然后将这个区间里的数翻转(0变成1,1变成0), 求翻转后这N张牌中1最多有几个?
【】暴力枚举【】
#include<stdio.h>int main(){ int s[101], t[101]; int n, ans, i, j, k, kk, max; while(~scanf("%d", &n)) { max = -1; for(i=0; i<n; i++) scanf("%d", &s[i]); for(i=0; i<n; i++) { for(j=i; j<n; j++) { for(k=0; k<n; k++) t[k] = s[k]; for(kk=i; kk<=j; kk++) { if(t[kk]) t[kk] = 0; else t[kk] = 1; } ans = 0; for(kk=0; kk<n; kk++) { if(t[kk]) ans++; } if(ans>max) max = ans; } } printf("%d\n", max); } return 0;}
- codeforces 327A
- codeforces 327A. Flipping Game
- Codeforces - 327A - Flipping Game
- CodeForces-327A Flipping Game
- Codeforces 327A Flipping Game
- codeforces 327A. Flipping Game
- CodeForces 327A Flipping Game
- Codeforces-327A-Flipping Game
- CodeForces-a
- Codeforces 903A A
- codeforces 327 A Ciel and Dancing
- CodeForces 18A A - Triangle
- CodeForces 133A A. HQ9+
- codeforces 651A A. Joysticks
- 【Codeforces 597A】A. Divisibility
- 【 Codeforces 615A】A. Bulbs
- A. Divisibility CodeForces 597A
- codeforces 417A A. Elimination
- iOS界面规范
- C 编译、链接、加载
- linux 学习日记一——ubuntu14.04安装
- 维度约间
- POJ 1860 Currency Exchange(最短路)
- codeforces 327A
- Android_Date显示时间格式_141027
- Linux下无法使用vpn解决方案
- Paypal学习 1 -- Buy now 按钮
- 开出博客第一天
- 第八周 项目4 个人所得税
- 迁移学习
- Shallow heap & Retained heap
- 自学python-django已经有一段时间。从今天开始写博客记录点滴经验与大家分享。