原题链接：http://codeforces.com/problemset/problem/583/B

题意：

就。。要打开一个电脑，必须至少先打开其他若干电脑，每次转向有个花费，让你设计一个序列，使得总花费最小。

题解：

就傻傻的走就好。。从左走到右，再走回来，更新序列和答案就好。

代码：

#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdio>
#define MAX_N 1003
using namespace std;int a[MAX_N];
int n;int cnt=0;
int ans=0;
int d=1;bool used[MAX_N];int main() {cin.sync_with_stdio(false);cin >> n;for (int i = 0; i < n; i++)cin >> a[i];int x = 0;while (cnt != n) {if (cnt >= a[x] && used[x] == 0) {cnt++;used[x] = 1;}if (cnt == n)break;x += d;if (x == n) {x = n - 2;d = -1;ans++;}if (x == -1) {x = 1;d = 1;ans++;}}cout << ans << endl;return 0;
}

转载于:https://www.cnblogs.com/HarryGuo2012/p/4854890.html

Codeforces 583 DIV2 Robot's Task 贪心相关推荐

codeforces#320(div2) D Or Game 贪心
codeforces#320(div2) D "Or" Game 贪心 D. "Or" Game time limit per test 2 seconds ...
codeforces#324(div2) E. Anton and Ira 贪心
codeforces#324(div2) E. Anton and Ira 贪心 E. Anton and Ira time limit per test 1 second memory limit ...
codeforces 628.div2
# Codeforces 628.div2 A. EhAb AnD gCd B. CopyCopyCopyCopyCopy C. Ehab and Path-etic MEXs D. Ehab the ...
Codeforces 437C The Child and Toy(贪心)
题目连接:Codeforces 437C The Child and Toy 贪心,每条绳子都是须要割断的,那就先割断最大值相应的那部分周围的绳子. #include <iostream> ...
CodeForces - 1395D - Boboniu Chats with Du 贪心
CodeForces - 1395D - Boboniu Chats with Du 贪心题意:如果ai>ma_i>mai>m,并且当天可以说话,则接下来ddd天不能说话.其余所 ...
codeforces 712 div2 ABC
codeforces 712 div2 ABC A. Déjà Vu A palindrome is a string that reads the same backward as forward. ...
【Codeforces 738D】Sea Battle（贪心）
http://codeforces.com/contest/738/problem/D Galya is playing one-dimensional Sea Battle on a 1 × n g ...
Educational Codeforces Round 12 C. Simple Strings 贪心
C. Simple Strings 题目连接: http://www.codeforces.com/contest/665/problem/C Description zscoder loves si ...
Codeforces 846 B Math Show DFS + 贪心
题目链接: http://codeforces.com/contest/846/problem/B 题目描述: 有N个节点, 每个节点有相同的K个子节点, 每个子节点有时间花费,完成一个子节点获得1分 ...

Codeforces 583 DIV2 Robot's Task 贪心

题意：

题解：

代码：

Codeforces 583 DIV2 Robot's Task 贪心相关推荐

最新文章

热门文章