fork download
copy 
  1. /*
  2. * @Author: hungeazy
  3. * @Date:   2025-07-04 21:15:45
  4. * @Last Modified by:   hungeazy
  5. * @Last Modified time: 2025-07-04 21:35:55
  6. */
  7. #include <bits/stdc++.h>
  8. #include <ext/pb_ds/assoc_container.hpp> 
  9. #include <ext/pb_ds/tree_policy.hpp> 
  10. // #pragma GCC optimize("O3")  
  11. // #pragma GCC optimize("unroll-loops")  
  12. // #pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")  
  13. using namespace std;
  14. using namespace __gnu_pbds; 
  15. bool M1;
  16. #define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
  17. #define int long long
  18. #define ll long long 
  19. #define ull unsigned long long
  20. #define sz(x) x.size()
  21. #define sqr(x) (1LL * (x) * (x))
  22. #define all(x) x.begin(), x.end()
  23. #define fill(f,x) memset(f,x,sizeof(f))
  24. #define FOR(i,l,r) for(int i=l;i<=r;i++)
  25. #define FOD(i,r,l) for(int i=r;i>=l;i--)
  26. #define debug(x) cout << #x << " = " << x << '\n'
  27. #define ii pair<int,int>
  28. #define iii pair<int,ii>
  29. #define di pair<ii,ii>
  30. #define vi vector<int>
  31. #define vii vector<ii>
  32. #define mii map<int,int>
  33. #define fi first
  34. #define se second
  35. #define pb push_back
  36. #define MOD 1000000007
  37. #define __lcm(a,b) (1ll * ((a) / __gcd((a), (b))) * (b))
  38. #define YES cout << "YES\n"
  39. #define NO cout << "NO\n"
  40. #define MASK(i) (1LL << (i))
  41. #define c_bit(i) __builtin_popcountll(i)
  42. #define BIT(x,i) ((x) & MASK(i))
  43. #define SET_ON(x,i) ((x) | MASK(i))
  44. #define SET_OFF(x,i) ((x) & ~MASK(i))
  45. #define oo 1e18
  46. #define name "MIND"
  47. #define endl '\n'
  48. #define memory() cerr << abs(&M2-&M1)/1024.0/1024 << " MB" << endl
  49. #define time() cerr << endl << "-------------Time:" << 1000.0 * clock() / CLOCKS_PER_SEC << "ms." << endl
  50. template<typename T> bool maximize(T &res, const T &val) { if (res < val){ res = val; return true; }; return false; }
  51. template<typename T> bool minimize(T &res, const T &val) { if (res > val){ res = val; return true; }; return false; }
  52. template <class T> using ordered_set = tree <T, null_type, less_equal <T>, rb_tree_tag,tree_order_statistics_node_update>;
  53. const int N = (int)1e5+10;
  54. int n,q,a[N];
  55.  
  56. struct Query {
  57. 	int l,r,id;
  58. } query[N];
  59. // Bai 4 - DTQG Ha Tinh 2024 - 756F
  60. namespace sub1 {
  61.  
  62. 	bool approved()
  63. 	{
  64. 		return n <= 100 and q <= 100;
  65. 	}
  66.  
  67. 	void solve(void)
  68. 	{
  69. 		FOR(i,1,q)
  70. 		{
  71. 			int l = query[i].l, r = query[i].r, ans = oo;
  72. 			FOR(j,l,r-1)
  73. 				FOR(k,j+1,r)
  74. 					minimize(ans,abs(a[j]-a[k]));
  75. 			cout << ans << endl;
  76. 		}
  77. 	}
  78.  
  79. }
  80.  
  81. namespace sub4 {
  82.  
  83. 	vii Q[N];
  84. 	int mn,res[N];
  85.  
  86. 	struct SegmentTree {
  87. 		vi st[N<<2];
  88. 		int ans[N<<2];
  89.  
  90. 		void build(int id, int l, int r)
  91. 		{
  92. 			FOR(i,l,r) st[id].pb(a[i]);
  93. 			sort(all(st[id]));
  94. 			ans[id] = oo;
  95. 			if (l == r) return;
  96. 			int mid = (l+r)>>1;
  97. 			build(id<<1,l,mid);
  98. 			build(id<<1|1,mid+1,r);
  99. 		}
  100.  
  101. 		void update(int id, int l, int r, int pos, int val)
  102. 		{
  103. 			if (r <= pos)
  104. 			{
  105. 				auto it = upper_bound(all(st[id]),val);
  106. 				if (it != st[id].end()) minimize(ans[id],*it-val);
  107. 				if (it != st[id].begin()) minimize(ans[id],val-*prev(it));
  108. 				if (ans[id] >= mn) return;
  109. 				if (l == r)
  110. 				{
  111. 					minimize(mn,ans[id]);
  112. 					return;
  113. 				}
  114. 			}
  115. 			int mid = (l+r)>>1;
  116. 			if (pos > mid) update(id<<1|1,mid+1,r,pos,val);
  117. 			update(id<<1,l,mid,pos,val);
  118. 			minimize(ans[id],min(ans[id<<1],ans[id<<1|1]));
  119. 			minimize(mn,ans[id]);
  120. 		}
  121.  
  122. 		int get(int id, int l, int r, int u, int v)
  123. 		{
  124. 			if (l > v or r < u) return oo;
  125. 			if (l >= u and r <= v) return ans[id];
  126. 			int mid = (l+r)>>1;
  127. 			return min(get(id<<1,l,mid,u,v),get(id<<1|1,mid+1,r,u,v));
  128. 		}
  129. 	} IT;
  130.  
  131. 	void solve(void)
  132. 	{
  133. 		IT.build(1,1,n);
  134. 		FOR(i,1,q)
  135. 		{
  136. 			int l = query[i].l, r = query[i].r, id = query[i].id;
  137. 			Q[r].pb({l,id});
  138. 		}
  139. 		FOR(i,2,n)
  140. 		{
  141. 			mn = oo;
  142. 			IT.update(1,1,n,i-1,a[i]);
  143. 			for (auto [l,id] : Q[i])
  144. 				res[id] = IT.get(1,1,n,l,i);
  145. 		}
  146. 		FOR(i,1,q) cout << res[i] << endl;
  147. 	}
  148.  
  149. }
  150.  
  151. bool M2;
  152. signed main()
  153. {
  154.     fast;
  155.     if (fopen(name".inp","r"))
  156.     {
  157.     	freopen(name".inp","r",stdin);
  158.     	freopen(name".out","w",stdout);
  159.     }
  160.     cin >> n >> q;
  161.     FOR(i,1,n) cin >> a[i];
  162.     FOR(i,1,q)
  163.     {
  164.     	cin >> query[i].l >> query[i].r;
  165.     	query[i].id = i;
  166.     }
  167.     if (sub1::approved()) return sub1::solve(), time(), memory(), 0;
  168.     sub4::solve();
  169.     time();
  170.     memory();
  171.     return 0;
  172. }
  173. // ██░ ██  █    ██  ███▄    █   ▄████
  174. //▓██░ ██▒ ██  ▓██▒ ██ ▀█   █  ██▒ ▀█▒
  175. //▒██▀▀██░▓██  ▒██░▓██  ▀█ ██▒▒██░▄▄▄░
  176. //░▓█ ░██ ▓▓█  ░██░▓██▒  ▐▌██▒░▓█  ██▓
  177. //░▓█▒░██▓▒▒█████▓ ▒██░   ▓██░░▒▓███▀▒
  178. // ▒ ░░▒░▒░▒▓▒ ▒ ▒ ░ ▒░   ▒ ▒  ░▒   ▒
  179. // ▒ ░▒░ ░░░▒░ ░ ░ ░ ░░   ░ ▒░  ░   ░
  180. // ░  ░░ ░ ░░░ ░ ░    ░   ░ ░ ░ ░   ░
  181. // ░  ░  ░   ░              ░       ░
Success #stdin #stdout #stderr 0.01s 17824KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Standard output is empty
stderr
copy 
-------------Time:8.702ms.
18.3125 MB
https://ideone.com/ZnClsB
language:
C++14 (gcc 8.3)
created:
8 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!