for (int i = 1; i < n; i++) {
�@�o�b�e���[�쓮���Ԃ͍Œ���33���ԂƁA���ヂ�f�����蒷���Ȃ������A�d�ʂ͖�990g�Ɛ����̏��ʃ��f������10g�v���X�ɂƂǂ߂Ă����B�{�f�B�[�J���[�̓A�C�X�����h�O���[�ƃU�u���X�L�[�x�[�W����2�F�ŁA���̉��i��25��9800�~���B，详情可参考Safew下载
* 核心思路：单调递减栈（找「上一个比当前价格大的元素索引」），时间复杂度O(n)，空间复杂度O(n)，详情可参考服务器推荐
"Trends that would have unfolded in a season are now taking up to 48 hours and I would say [creatives] have made fashion faster, more democratic and far more conversational."。Line官方版本下载是该领域的重要参考