Submission #1068856

#	Time	Username	Problem	Language	Result	Execution time	Memory
1068856		PotatoTheWarriorFRTT	Global Warming (CEOI18_glo)	C++14	25 / 100	2064 ms	4700 KiB

glo

#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
ll p1 = 27644437;
ll p2 = 1000000007;
int LIS(int n, ll a[]) {
    const int INF = 1e9;
    vector<int> d(n+1, INF);
    d[0] = -INF;

    for (int i = 0; i < n; i++) {
        int l = upper_bound(d.begin(), d.end(), a[i]) - d.begin();
        if (d[l-1] < a[i] && a[i] < d[l])
            d[l] = a[i];
    }

    int ans = 0;
    for (int l = 0; l <= n; l++) {
        if (d[l] < INF)
            ans = l;
    }
    return ans;
}
// int LIS(int n, ll a[]) {
//     ll dp[n+1]; // dp[l] = smallest element at which a sequence of size l ends;
//     int ans = 1;
//     dp[1] = a[0];
//     for(int i=1;i<n;i++) {
//         if(dp[ans] < a[i]) {
//             ans++;
//             dp[ans] = a[i];
//         }else if(a[i] < dp[1]) {
//             dp[1] = a[i];
//         }else{
//             int r = ans;
//             int l = 1;
//             while(r - l > 1) {
//                 int m = (r+l)/2;
//                 if(a[i] < dp[m]) {
//                     r = m;
//                 }else if(a[i] >= dp[m]) {
//                     l = m;
//                 }
//             }
//             dp[r] = a[i]; 
//         }
//     }
//     return ans;
// }

void solve() {
    int n, x; cin >> n >> x;
    ll a[n+1];

    for(int i=0;i<n;i++) {
        cin >> a[i];
    }
    if(x == 0) {
        cout << LIS(n, a) << endl;
    }else{
        int ans = 1;
        x=abs(x);
        for(int i=0;i<n;i++) {
            for(int j=i;j<n;j++) {
                for(int d=-x;d<=x;d++) {
                    for(int k=i;k<=j;k++) {
                        a[k]+=d;
                    }
                    ans = max(ans, LIS(n, a));
                    for(int k=i;k<=j;k++) {
                        a[k]-=d;
                    }
                }
            }
        }
        cout << ans << endl;
    }
 
}
int main()   {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    // int t; cin >> t;
    // while(t--) 
        solve();
 
    char dksfjn;
    cin >> dksfjn;
}

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