Codeforces Round #445 C. Petya and Catacombs 贪心
来源:互联网 发布:c语言编程求最简分数 编辑:程序博客网 时间:2024/06/08 00:24
http://codeforces.com/problemset/problem/886/C
题意:
思路:仔细一想,如果对于每一个数字,我能利用之前的数字那肯定最吼不过了,那么我就尽可能利用之前出现过
的数字,这样一定是最优的,当我没有房间进的时候,那么我新开一个房间,就这样贪心就好了。
对代码的解释:G[x][i]代表x位置上有没有之前已经访问过的房间,如果没有,那么我在当前位置新开一个房间代表
我这是走的新的房间,如果之前有访问过的房间,那么我更新一下这个房间的访问时间。
/// .-~~~~~~~~~-._ _.-~~~~~~~~~-./// __.' ~. .~ `.__/// .'// \./ \\`./// .'// | \\`./// .'// .-~"""""""~~~~-._ | _,-~~~~"""""""~-. \\`./// .'//.-" `-. | .-' "-.\\`./// .'//______.============-.. \ | / ..-============.______\\`./// .'______________________________\|/______________________________`.#pragma GCC optimize(2)#pragma comment(linker, "/STACK:102400000,102400000")#include <vector>#include <iostream>#include <string>#include <map>#include <stack>#include <cstring>#include <queue>#include <list>#include <stdio.h>#include <set>#include <algorithm>#include <cstdlib>#include <cmath>#include <iomanip>#include <cctype>#include <sstream>#include <functional>#include <stdlib.h>#include <time.h>#include <bitset>using namespace std;#define pi acos(-1)#define s_1(x) scanf("%d",&x)#define s_2(x,y) scanf("%d%d",&x,&y)#define s_3(x,y,z) scanf("%d%d%d",&x,&y,&z)#define s_4(x,y,z,X) scanf("%d%d%d%d",&x,&y,&z,&X)#define S_1(x) scan_d(x)#define S_2(x,y) scan_d(x),scan_d(y)#define S_3(x,y,z) scan_d(x),scan_d(y),scan_d(z)#define PI acos(-1)#define endl '\n'#define srand() srand(time(0));#define me(x,y) memset(x,y,sizeof(x));#define foreach(it,a) for(__typeof((a).begin()) it=(a).begin();it!=(a).end();it++)#define close() ios::sync_with_stdio(0); cin.tie(0);#define FOR(x,n,i) for(int i=x;i<=n;i++)#define FOr(x,n,i) for(int i=x;i<n;i++)#define fOR(n,x,i) for(int i=n;i>=x;i--)#define fOr(n,x,i) for(int i=n;i>x;i--)#define W while#define sgn(x) ((x) < 0 ? -1 : (x) > 0)#define bug printf("***********\n");#define db double#define ll long long#define mp make_pair#define pb push_backtypedef long long LL;typedef pair <int, int> ii;const int INF=~0U>>1;const LL LINF=0x3f3f3f3f3f3f3f3fLL;const int dx[]={-1,0,1,0,1,-1,-1,1};const int dy[]={0,1,0,-1,-1,1,-1,1};const int maxn=2e5+10;const int maxx=1e3+10;const double EPS=1e-8;const double eps=1e-8;const int mod=1e9+7;template<class T>inline T min(T a,T b,T c) { return min(min(a,b),c);}template<class T>inline T max(T a,T b,T c) { return max(max(a,b),c);}template<class T>inline T min(T a,T b,T c,T d) { return min(min(a,b),min(c,d));}template<class T>inline T max(T a,T b,T c,T d) { return max(max(a,b),max(c,d));}template <class T>inline bool scan_d(T &ret){char c;int sgn;if (c = getchar(), c == EOF){return 0;}while (c != '-' && (c < '0' || c > '9')){c = getchar();}sgn = (c == '-') ? -1 : 1;ret = (c == '-') ? 0 : (c - '0');while (c = getchar(), c >= '0' && c <= '9'){ret = ret * 10 + (c - '0');}ret *= sgn;return 1;}inline bool scan_lf(double &num){char in;double Dec=0.1;bool IsN=false,IsD=false;in=getchar();if(in==EOF) return false;while(in!='-'&&in!='.'&&(in<'0'||in>'9'))in=getchar();if(in=='-'){IsN=true;num=0;}else if(in=='.'){IsD=true;num=0;}else num=in-'0';if(!IsD){while(in=getchar(),in>='0'&&in<='9'){num*=10;num+=in-'0';}}if(in!='.'){if(IsN) num=-num;return true;}else{while(in=getchar(),in>='0'&&in<='9'){num+=Dec*(in-'0');Dec*=0.1;}}if(IsN) num=-num;return true;}void Out(LL a){if(a < 0) { putchar('-'); a = -a; }if(a >= 10) Out(a / 10);putchar(a % 10 + '0');}void print(LL a){ Out(a),puts("");}//freopen( "in.txt" , "r" , stdin );//freopen( "data.txt" , "w" , stdout );//cerr << "run time is " << clock() << endl;int n;vector<int>G[maxn];void solve(){W(cin>>n){int tot=1;G[0].pb(1);FOR(1,n,i){int x;s_1(x);if(G[x].size()==0)G[i].pb(i);else {G[x].erase(G[x].begin());G[i].pb(i);}}int sum=0;FOR(0,maxn-1,i){if(G[i].size()) sum++;G[i].clear();}print(sum);}}int main(){ //freopen( "1.in" , "r" , stdin ); //freopen( "1.out" , "w" , stdout ); int t=1; //init(); //s_1(t); for(int cas=1;cas<=t;cas++) { //printf("Case #%d: ",cas); solve(); }}
阅读全文
0 0
- Codeforces Round #445 C. Petya and Catacombs 贪心
- Codeforces 890 C. Petya and Catacombs (贪心)
- CodeForces 890C Petya and Catacombs
- Codeforces Beta Round #85 (Div. 1 Only), problem: (C) Petya and Spiders 状态压缩
- Codeforces Beta Round #85 (Div. 1 Only) C. Petya and Spiders
- Codeforces Round #319 (Div. 2) ——C. Vasya and Petya's Game(数学题)
- Codeforces Round #319 (Div. 2) 577C Vasya and Petya's Game(筛选法)
- Codeforces Round #319 (Div. 2) C. Vasya and Petya's Game
- Codeforces Round #319 (Div. 2) C Vasya and Petya's Game
- codeforces 111C Petya and Spiders
- 【codeforces 111C】 Petya and Spiders
- CodeForces - 111C Petya and Spiders
- Codeforces Round #212 (Div. 2) B. Petya and Staircases
- Codeforces Beta Round #61 (Div. 2) E. Petya and Post
- Codeforces Round #212 (Div. 2) B. Petya and Staircases
- Petya and Exam(Codeforces Round #425 (Div. 2))
- Codeforces Round #425 (Div. 2)B. Petya and Exam
- Codeforces Round #425 (Div. 2) B. Petya and Exam
- Spring在maven中的全依赖
- codeforces 888G.Xor-MST(01字典树+贪心+最小异或生成树)
- canvas相关API
- Deep learning REVIEW--三位大牛的Nature
- 动态内存,智能指针
- Codeforces Round #445 C. Petya and Catacombs 贪心
- CENTOS7安装MYSQL
- Hadoop、Storm、Spark这三个大数据平台的区别和不同的应用场景
- dedecms PC移动端同一后台
- Neural Style
- Linux命令(17)——su与sudo命令
- Unity中Sprite和UI Image的区别
- 爬虫感悟3
- day-11:读取项目中的所有pom.xml文件中所有的version标签