spoj:DRUIDEOI - Fata7y Ya Warda!(单调栈)

DRUIDEOI - Fata7y Ya Warda!

no tags 

Druid (AKA Amr Alaa El-Deen) and little EOIers have finished their training and they are playing "Fatta7y ya warda!". It's a kids game when everyone holds hands with two other kids forming a circle, and they keep saying "Fatta7y ya warda!" (Flourish, flower!) (moving away from each other, while still holding hands, to form a huge circle), then "2affely ya warda!" (Die, flower!) (moving back as close to each other as possible, while still holding hands, to form a tiny circle, i.e. a point). That's it!

Anyway the point is...

While Eagle (AKA Mohamed Ahmed) was watching them playing he was wondering, who's the first person taller than Druid on his left? Similarly, who's the first person taller than Druid on his right? Help Eagle find the answer for each person not just Druid.

Input

The input starts with an integer T (1  T  20), the number of test cases.

Each test case contains two lines. The first line contains a single integer N (1 ≤ N ≤ 105), the number of persons playing the game. The second line contains N integers hi (1 ≤ hi ≤ 109) the height of the i-th person. They are numbered 1 to N starting from Druid.

Output

For each test case print N lines, in the i-th line print 2 numbers, the index of the first person taller than the i-th person on his left, and the index of the first person taller than the i-th person on his right. If no one is taller than the i-th person print -1 -1.

Example

Input:
3 5
172 170 168 171 169
3
172 169 172 
1
172
Output:
-1 -1
1 4
2 4
1 1
4 1
-1 -1
1 3
-1 -1
-1 -1

Note

The Third sample.

题意:n个数形成一个环,1号的左边是n号,位置i的数值是ai,输出每一个数左边和右边,第一个比他大的数的位置,如果不存在这样的位置,输出-1。

思路:因为是一个圆圈,所以将数组开大两倍,模拟转圈,然后维护一个单调递增栈。

mycode:

# include <stdio.h>
# include <string.h>
# include <stack>
# define MAXN 100000
using namespace std;
int a[MAXN<<1+3], l[MAXN<<1+3], r[MAXN<<1+3], t, n, i, j;
int main()
{
    stack<int>st;
    scanf("%d",&t);
    while(t--)
    {
        memset(l, 0, sizeof(l));
        memset(r, 0, sizeof(r));
        while(!st.empty())
            st.pop();
        scanf("%d",&n);
        for(i=1; i<=n; ++i)
            scanf("%d",&a[i]), a[i+n] = a[i];
        for(i=1; i<=(n<<1); ++i)//计算左边
        {
            if(st.empty())
            {
                l[i] = -1;
                st.push(i);
            }
            else if(a[i] >= a[st.top()])
            {
                while(!st.empty() && a[i]>=a[st.top()])
                    st.pop();
                if(!st.empty() && st.top()!=i-n)
                    l[i] = st.top();
                else
                    l[i] = -1;
                st.push(i);
            }
            else
            {
                l[i] = st.top();
                st.push(i);
            }
        }
        while(!st.empty())
            st.pop();
        for(i=n<<1; i>=1; --i)//计算右边
        {
            if(st.empty())
            {
                r[i] = -1;
                st.push(i);
            }
            else if(a[i] >= a[st.top()])
            {
                while(!st.empty() && a[i]>=a[st.top()])
                    st.pop();
                 if(!st.empty() && st.top()!=i+n)
                    r[i] = st.top();
                else
                    r[i] = -1;
                st.push(i);
            }
            else
            {
                r[i] = st.top();
                st.push(i);
            }
        }
        for(i=n+1; i<=(n<<1); ++i)//输出
        {
            if(l[i]<=n)
                printf("%d ",l[i]);
            else
                printf("%d ",l[i]-n);
            if(r[i-n]<=n)
                printf("%d\n",r[i-n]);
            else
                printf("%d\n",r[i-n]-n);
        }
    }

    return 0;
}

others code:from Walker

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <cmath>
#include <iostream>
#include <algorithm>

using namespace std;

int test, n, a[200001], f[200001], v[200001];
 
int main() {
	//freopen("1.txt", "r", stdin);
	//freopen("2.txt", "w", stdout);
	scanf("%d", &test);
	for (; test--; ) 
	{
		scanf("%d", &n);
		for (int i = 1; i <= n; i++)
			scanf("%d", &a[i]), a[i + n] = a[i];
		for (int i = 1; i <= n << 1; i++) 
		{
			int now = i - 1;
			for (; now && a[i] >= a[now]; now = f[now]);
			f[i] = now;
		}
		for (int i = n << 1; i; --i) 
		{
			int now = i + 1;
			for (; now != (n << 1) + 1 && a[i] >= a[now]; now = v[now]);
			v[i] = now;
		}
		for (int i = n + 1; i <= n << 1; i++)
		{
			if (!f[i]) printf("-1");
			else 
				if (f[i] <= n)
					printf("%d", f[i]);
				else 
					printf("%d", f[i] - n);
			printf(" ");
			if (v[i - n] == n + n + 1) printf("-1");
			else 
				if (v[i - n] <= n)
					printf("%d", v[i - n]);
				else
					printf("%d", v[i - n] - n);
			printf("\n");
		}
	}
			
}



转载于:https://www.cnblogs.com/junior19/p/6730069.html

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
资源包主要包含以下内容: ASP项目源码:每个资源包中都包含完整的ASP项目源码,这些源码采用了经典的ASP技术开发,结构清晰、注释详细,帮助用户轻松理解整个项目的逻辑和实现方式。通过这些源码,用户可以学习到ASP的基本语法、服务器端脚本编写方法、数据库操作、用户权限管理等关键技术。 数据库设计文件:为了方便用户更好地理解系统的后台逻辑,每个项目中都附带了完整的数据库设计文件。这些文件通常包括数据库结构图、数据表设计文档,以及示例数据SQL脚本。用户可以通过这些文件快速搭建项目所需的数据库环境,并了解各个数据表之间的关系和作用。 详细的开发文档:每个资源包都附有详细的开发文档,文档内容包括项目背景介绍、功能模块说明、系统流程图、用户界面设计以及关键代码解析等。这些文档为用户提供了深入的学习材料,使得即便是从零开始的开发者也能逐步掌握项目开发的全过程。 项目演示与使用指南:为帮助用户更好地理解和使用这些ASP项目,每个资源包中都包含项目的演示文件和使用指南。演示文件通常以视频或图文形式展示项目的主要功能和操作流程,使用指南则详细说明了如何配置开发环境、部署项目以及常见问题的解决方法。 毕业设计参考:对于正在准备毕业设计的学生来说,这些资源包是绝佳的参考材料。每个项目不仅功能完善、结构清晰,还符合常见的毕业设计要求和标准。通过这些项目,学生可以学习到如何从零开始构建一个完整的Web系统,并积累丰富的项目经验。
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值