Submission #497013

#	Time	Username	Problem	Language	Result	Execution time	Memory
497013		Nuraly_Serikbay	Maxcomp (info1cup18_maxcomp)	C++14	15 / 100	2 ms	204 KiB

maxcomp

#include <bits/stdc++.h>
  
#define endl "\n"
#define mp make_pair
#define pb push_back
#define F first
#define S second
#define sz size()
#define rep(i,k,n) for(int i = k ; i <= n ; ++i)
#define per(i,k,n) for(int i = k ; i >= n ; --i)
#define Zymraq() ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define all(x) x.begin(),x.end()
#define fr(x) freopen(x".in","r",stdin),freopen(x".out","w",stdout)
#define toqta return 0
#define PERMUTE next_permutation
#define no cout<<"No"<<endl;
#define yes cout<<"Yes"<<endl;
#define a() a + 1, a + n + 1  
 
  
using namespace std;
   
typedef long long ll;
typedef unsigned long long ull;
typedef string S;
typedef double ld;
typedef long double lld;
   
const int N = 1e6 + 17;
const int modd = 1e9 + 7;
const ll INF = 1e18 - 19;
const int P = 37;
const ll NN = 1e7 + 17;
const ld eps = 1e-19;
const double pi = 3.141592653589793238462643383279 ;
   
 
bool sortbysec(const pair<int,int> &a, const pair<int,int> &b){
    return (a.second < b.second);
}
 
void pre (ll a) {
    cout << fixed << setprecision(a);
    return;
}

ll n, m, a[N], mx;

void solve() {
		cin >> n >> m;
		for (int i = 1; i <= m; ++ i) {
			cin >> a[i];
		}
		for (int i = 1; i <= m; ++ i) {
			for (int j = i + 1; j <= m; ++ j) {
				if (abs(a[i] - a[j]) - (j - i + 1) > mx) {
					mx = abs(a[i] - a[j]) - (j - i + 1);
				}
			}
		}
		cout << mx;
		return;
}
 
int main() {
//	Zymraq ();	
	solve();
	return 0;
}

• Subtask 1: 0 / 15
• Subtask 2: 15 / 15
• Subtask 3: 0 / 30
• Subtask 4: 0 / 40