Submission #1228752

#TimeUsernameProblemLanguageResultExecution timeMemory
1228752dinhhiepStove (JOI18_stove)C++20
0 / 100
0 ms320 KiB
#include<bits/stdc++.h>
using namespace std;
const long long N=1e5+5;
bool ok[N];
int a[N];
int dp[N];
int res;
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n,k;
    cin >> n >> k;
    for(int i = 0;i < n ; i++) cin >> a[i];
    dp[0]=1;
    for(int i=0;i<n;i++){
       if(k>=n){
        cout << n;
        return 0;
       }
       else{
            for(int i=0;i<n;i++){
                dp[i]=a[i+1]+1-a[i];
                res=max(res,dp[i]);
            }
        }
    }
    cout << res;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...