Submission #156629

---

Source Code Expand

#include <vector>
#include <list>
#include <string>
#include <iostream>
#include <array>
#include <algorithm>
#include <stdio.h>
//#include <boost/format.hpp>
//#include <boost/tokenizer.hpp>
//#include <boost/foreach.hpp>
//#include <boost/lexical_cast.hpp>
//using namespace boost;
using namespace std;

static auto solve = [](int n, vector<int>& c)
{
	int result = 0;
	int j = 1;
	int i = 0;
	while(i < n)
	{
		cout << c[i] << " vs " << j << endl;
		if (c[i] == j)
		{
			++i, ++j;
		}
		else if(c[i] < j)
		{
			++i;
		}
		else
		{
			++result;
			++j;
		}
	}
	return result;
};

int main(int argv, char* argc[])
{
	int n;
	cin >> n;
	vector<int> c(n);
	for (auto &i : c)
		cin >> i;
	cout << solve(n, c) << endl;

	return 0;
}

Submission Info

Judge Result