Submission #724979

#	Time	Username	Problem	Language	Result	Execution time	Memory
724979		AndrijaM	은행 (IZhO14_bank)	C++14	0 / 100	0 ms	212 KiB

bank

#include <bits/stdc++.h>

using namespace std;

const int maxn=1e5+10;
int n;
int k;
int x[maxn];
int sum[maxn];
vector<int>ans;

int f(int idx,int kol,vector<int>v)
{
    if(kol==0)
    {
        ans=v;
        return sum[n-1]-sum[idx];
    }
    int rez=0;
    for(int i=idx+1;i<n-1;i++)
    {
        vector<int>pom;
        pom=v;
        pom.push_back(i);
        if(idx==-1)
        {
            int koj=kol-1;
            if(koj>=0)
            rez=max(rez, f(i,koj,pom)*sum[i]);
        }
        else
        {
            int koj=kol-1;
            if(koj>=0)
            rez=max(rez, f(i,koj,pom)*(sum[i]-sum[idx]));
        }
    }
    return rez;
}

int main()
{
    
    return 0;
}

• Subtask 1: 0 / 19
• Subtask 2: 0 / 25
• Subtask 3: 0 / 27
• Subtask 4: 0 / 29