Submission #791015

#	Time	Username	Problem	Language	Result	Execution time	Memory
791015		JakobZorz	Global Warming (CEOI18_glo)	C++14	5 / 100	2073 ms	2900 KiB

glo

#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <set>
#include <stack>
#include <limits.h>
#include <math.h>
#include <iomanip>
#include <bitset>
#include <unordered_map>
#include <unordered_set>
#include <map>
#include <cstring>
#include <sstream>
 
#pragma GCC target("popcnt")
 
typedef long long ll;
typedef long double ld;
using namespace std;
const int MOD=1e9+7;
typedef pair<ll,ll>point;
//#define x first
//#define y second

int n,x;
int arr[200000];

int get(int curr,int end){
    int res=1;
    int a=arr[curr];
    if(end>curr)
        a-=x;
    for(int i=0;i<curr;i++){
        int b=arr[i];
        if(end>i)
            b-=x;
        
        if(b<a)
            res=max(res,get(i,end)+1);
    }
    
    return res;
}

int main(){
    ios::sync_with_stdio(false);
    cout.tie(NULL);
    cin.tie(NULL);
    
    //freopen("speeding.in","r",stdin);
    //freopen("speeding.out","w",stdout);
    
    cin>>n>>x;
    for(int i=0;i<n;i++)
        cin>>arr[i];
    
    int res=0;
    for(int end=0;end<=n;end++){
        for(int i=0;i<n;i++){
            res=max(res,get(i,end));
        }
    }
    
    cout<<res<<"\n";
    
    return 0;
}

/*
 
8 10
7 3 5 12 2 7 3 4
 
 */

• Subtask 1: 5 / 5
• Subtask 2: 0 / 10
• Subtask 3: 0 / 13
• Subtask 4: 0 / 10
• Subtask 5: 0 / 20
• Subtask 6: 0 / 17
• Subtask 7: 0 / 25