Submission #1292248

#TimeUsernameProblemLanguageResultExecution timeMemory
1292248chaitanyamehtaSolar Storm (NOI20_solarstorm)C++20
8 / 100
345 ms27484 KiB
// 
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int ,int>
#define all(a) a.begin() , a.end()

signed main(){
    int n , s , k;
    cin>>n>>s>>k;
    vector<int> d(n + 1 , 0) , di(n + 1, 0);
    for(int i = 1 ; i <= n-1; i++){
        cin>>di[i];
    }
    vector<int> v(n +1, 0);
    for(int i = 1 ;i <= n ; i++)cin>>v[i];

    int cnt = min(s , n);
    cout <<cnt <<"\n";
    cnt =0;
    int  sum = 0;
    vector<int> a;
    for(int i = 1; i <= min( n ,s) ;i++){
        sum += v[i];
    }
    int ans = 0;
    int t  = min(n , s) , start;
    for(int i = min(n , s) ; i < n ; i++){
        sum -= v[i - t];
        sum += v[i];
        if(sum > ans){
            ans = max(sum , ans);
            start = i - t + 1;
        }
    }
    // cout << ans << "\n";
    for(int i = 0 ; i < t ; i++){
        cout << start + i << " ";  
    }

}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...