[42583] 주식가격

#include <iostream>
#include <string>
#include <vector>
using namespace std;
vector<int> solution(vector<int> prices)
{
	vector<int> answer;
	int i, j, time = 0;
	for (i = 0; i < prices.size(); i++)
	{
		int max = prices[i];
		for (j = i; j < prices.size() - 1; j++)
			if (max <= prices[j])
				time++;
			else
				break;
		answer.push_back(time);
		time = 0;
	}
	return answer;
}