有的O(1)TLE,有的O(logn)跑的飞快
查看原帖
有的O(1)TLE,有的O(logn)跑的飞快
1031575
CompileEasily楼主2024/5/16 14:04

rt,

ac代码

#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N = 1e5 + 5;
int n,m;
int fx[N][20];
signed main()
{
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	cin >> n >> m;
	for(int i = 1;i <= n;i++)
	{
		cin >> fx[i][0];
	}
	for(int j = 1;j <= log2(n);j++)
	{
		for(int i = 1;i <= n - (1 << j) + 1;i++)
		{
			fx[i][j] = max(fx[i][j - 1],fx[i + (1 << (j - 1))][j - 1]);
		}
	}
	for(int d = 1;d <= m;d++)
	{
		int i,j;
		cin >> i >> j;
		int k = (int)log2(j - i + 1);
		cout << max(fx[i][k],fx[j - (1 << k) + 1][k]) << "\n";
	}
}
2024/5/16 14:04
加载中...