#include <bits/stdc++.h>
#include "xylophone.h"
#define ericxiao cin.tie(0); ios_base::sync_with_stdio(false);
#define endl '\n'
// #define int long long
using namespace std;
typedef pair<int,int> pii;
const int maxn=1e4+10;
int ans[maxn];
// int query(int s,int t){
// return (*max_element(ans+s,ans+t+1))-(*min_element(ans+s,ans+t+1));
// }
// void answer(int i,int a){
// cout<<i<<' '<<a<<endl;
// }
int two[maxn],three[maxn],a[maxn];
void solve(int n){
for(int i=1;i<=n-1;i++) two[i]=query(i,i+1);
for(int i=1;i<=n-2;i++) three[i]=query(i,i+2);
a[2]=two[1];
for(int i=3;i<=n;i++){
a[i]=a[i-1]+two[i-1];
if(max({a[i-2],a[i-1],a[i]})-min({a[i-2],a[i-1],a[i]})==three[i-2])
continue;
a[i]=a[i-1]-two[i-1];
}
int minn=*min_element(a,a+n);
if(max_element(a,a+n)-min_element(a,a+n)>0)
for(int i=1;i<=n;i++)
answer(i,a[i]-minn+1);
else
for(int i=1;i<=n;i++)
answer(i,n-a[i]+minn);
}
// signed main(){
// int n; cin>>n;
// for(int i=1;i<=n;i++) cin>>ans[i];
// solve(n);
// return 0;
// }
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
5 ms |
376 KB |
Wrong Answer [7] |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
5 ms |
376 KB |
Wrong Answer [7] |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
5 ms |
376 KB |
Wrong Answer [7] |
| 2 |
Halted |
0 ms |
0 KB |
- |
