一个神奇的题目
定义 d i = c i + 1 − c i d_i=c_{i+1}-c_i di=ci+1−ci, c j ′ = c j + 1 + c j − 1 − c j {c_j}'=c_{j+1}+c_{j-1}-c_j cj′=cj+1+cj−1−cj
推一下式子,见证奇迹吧!
- d j − 1 ′ = c j ′ − c j − 1 = ( c j + 1 + c j − 1 − c j ) − c j − 1 = c j + 1 − c j = d j {d_{j-1}}'={c_j}'-c_{j-1}=(c_{j+1}+c_{j-1}-c_j)-c_{j-1}=c_{j+1}-c_j=d_j dj−1′=cj′−cj−1=(cj+1+cj−1−cj)−cj−1=cj+1−cj=dj ;
- d j ′ = c j + 1 − c j ′ = c j + 1 − ( c j + 1 + c j − 1 − c j ) = c j − c j − 1 = d j − 1 {d_j}'=c_{j+1}-{c_j}'=c_{j+1}-(c_{j+1}+c_{j-1}-c_j)=c_j-c_{j-1}=d_{j-1} dj′=cj+1−cj′=cj+1−(cj+1+cj−1−cj)=cj−cj−1=dj−1
通过上面的结论,我们可以通过一种快速的方法:
同样定义 f i = t i + 1 − t i f_i=t_{i+1}-t_i fi=ti+1−ti
我们只需在 O ( n ) O(n) O(n) 时间算出 d i d_i di 和 f i f_i fi
是否能够更改就等价于排序后 ∑ i = 1 n d i = f i \sum\limits_{i=1}^nd_i=f_i i=1∑ndi=fi
问题搞定,太神奇了!!
#include <map>
#include <set>
#include <ctime>
#include <queue>
#include <stack>
#include <cmath>
#include <vector>
#include <bitset>
#include <cstdio>
#include <cctype>
#include <string>
#include <numeric>
#include <cstring>
#include <cassert>
#include <climits>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <functional>
using namespace std ;
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
#define loop(s, v, it) for (s::iterator it = v.begin(); it != v.end(); it++)
#define cont(i, x) for (int i = head[x]; i; i = e[i].nxt)
#define clr(a) memset(a, 0, sizeof(a))
#define ass(a, sum) memset(a, sum, sizeof(a))
#define lowbit(x) (x & -x)
#define all(x) x.begin(), x.end()
#define pq priority_queue
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define iv inline void
#define enter cout << endl
#define siz(x) ((int)x.size())
#define file(s) freopen(s".in", "r", stdin), freopen(s."out", "w", stdout)
typedef long long ll ;
typedef unsigned long long ull ;
typedef pair <int, int> pii ;
typedef vector <int> vi ;
typedef vector <pii> vii ;
typedef queue <int> qi ;
typedef set <int> si ;
typedef map <int, int> mii ;
typedef map <string, int> msi ;
const int N = 100010 ;
const int INF = 0x3f3f3f3f ;
const int iinf = 1 << 30 ;
const ll linf = 2e18 ;
const int MOD = 1000000007 ;
const double eps = 1e-7 ;
void print(int x) { cout << x << endl ; exit(0) ; }
void PRINT(string x) { cout << x << endl ; exit(0) ; }
void douout(double x){ printf("%lf\n", x + 0.0000000001) ; }
int a[N], b[N] ;
int n ;
signed main(){
scanf("%d", &n) ;
rep(i, 1, n) scanf("%d", &a[i]) ;
rep(i, 1, n) scanf("%d", &b[i]) ;
per(i, n, 1) a[i] -= a[i - 1], b[i] -= b[i - 1] ;
sort(a + 2, a + n + 1) ; sort(b + 2, b + n + 1) ;
rep(i, 1, n)
if (a[i] != b[i]) PRINT("No") ;
PRINT("Yes") ;
return 0 ;
}
/*
写代码时请注意:
1.ll?数组大小,边界?数据范围?
2.精度?
3.特判?
4.至少做一些
思考提醒:
1.最大值最小->二分?
2.可以贪心么?不行dp可以么
3.可以优化么
4.维护区间用什么数据结构?
5.统计方案是用dp?模了么?
6.逆向思维?
*/