Submission #2181956
Source Code Expand
//#include <bits/stdc++.h>
#include <iostream>
#include <algorithm>
#include <bitset>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <stack>
#include <queue>
#include <deque>
#include <cstring>
#include <string>
#include <utility>
#include <array>
#include <complex>
#include <valarray>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <chrono>
#include <random>
#include <numeric>
using namespace std;
#define int long long
typedef long long ll;
typedef unsigned long long ull;
//typedef unsigned __int128 HASH;
typedef pair<int,int> pii;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pullull;
typedef pair<ll,int> plli;
typedef pair<double, int> pdbi;
typedef pair<int,pii> pipii;
typedef pair<ll,pll> plpll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<pii> vpii;
typedef vector<vector<int>> mat;
#define rep(i,n) for (int i=0;i<(n);i++)
#define rep2(i,a,b) for (int i=(a);i<(b);i++)
#define rrep(i,n) for (int i=(n);i>0;i--)
#define rrep2(i,a,b) for (int i=(a);i>b;i--)
#define pb push_back
#define fi first
#define se second
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
const ll hmod1 = 999999937;
const ll hmod2 = 1000000000 + 9;
const int INF = 1<<30;
const ll INFLL = 1LL<<62;
const double EPS = 1e-12;
const ll mod = 1000000000 + 7;
const int dx4[4] = {1, 0, -1, 0};
const int dy4[4] = {0, 1, 0, -1};
const int dx8[8] = {1, 1, 1, 0, 0, -1, -1, -1};
const int dy8[8] = {0, 1, -1, 1, -1, 0, 1, -1};
const double pi = 3.141592653589793;
#define addm(X, Y) (X) = ((X) + ((Y) % mod) + mod) % mod
#define inside(y, x, h, w) (0 <= (y) && (y) < (h) && 0 <= (x) && (x) < (w)) ? true : false
//debug
#define DEBUG
#define DUMPOUT cout
#ifdef DEBUG
#define dump(...) DUMPOUT<<#__VA_ARGS__<<" :["<<__FUNCTION__<<":"<<__LINE__<<"]"<<endl; DUMPOUT<<" "; dump_func(__VA_ARGS__)
#else
#define dump(...)
#endif
void dump_func() {DUMPOUT << endl;};
template <class Head, class... Tail> void dump_func(Head&& head, Tail&&... tail) {
DUMPOUT << head;
if (sizeof...(Tail) == 0) DUMPOUT << " ";
else DUMPOUT << ", ";
dump_func(std::move(tail)...);
}
//ostream
template<typename T> ostream& operator << (ostream& os, vector<T>& vec) {
os << "["; for (int i = 0; i<vec.size(); i++) os << vec[i] << (i + 1 == vec.size() ? "" : ", "); os << "]";
return os;
}
template<typename T, typename U> ostream& operator << (ostream& os, pair<T, U>& pair_var) {
os << "(" << pair_var.first << ", " << pair_var.second << ")";
return os;
}
template<typename T, typename U> ostream& operator << (ostream& os, map<T, U>& map_var) {
os << "[";
for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {
os << "(" << itr->first << ", " << itr->second << ")"; itr++; if(itr != map_var.end()) os << ", "; itr--;
}
os << "]";
return os;
}
template<typename T> ostream& operator << (ostream& os, set<T>& set_var) {
os << "[";
for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {
os << *itr; ++itr; if(itr != set_var.end()) os << ", "; itr--;
}
os << "]";
return os;
}
int n, m, k;
int a[100005];
int dp[100005];
struct segtree {
int size;
vector<long long> node;
segtree (int n) : size(1) {
while (size < n) size *= 2;
node.resize(2 * size - 1, -INFLL / 2);
}
void update(int k, int a) {
k += size - 1;
node[k] = a;
while (k > 0){
k = (k - 1) / 2;
node[k] = max(node[2 * k + 1], node[2 * k + 2]);
}
}
//[queryL: queryR)
long long get(int queryL, int queryR, int k = 0, int nodeL = 0, int nodeR = -1) {
if (nodeR == -1) nodeR = size;
if (nodeR <= queryL || queryR <= nodeL) return -INFLL; //初期値より小さく
if (queryL <= nodeL && nodeR <= queryR) return node[k];
else{
int nodeM = (nodeL + nodeR) / 2;
long long vl = get(queryL, queryR, 2 * k + 1, nodeL, nodeM);
long long vr = get(queryL, queryR, 2 * k + 2, nodeM, nodeR);
return max(vl, vr);
}
}
};
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n >> m >> k;
rep(i, n) cin >> a[i];
segtree seg(n);
rep(i, k) {
rep(j, n) {
if (i == 0) dp[j] = a[j] * (i + 1);
else {
dp[j] = seg.get(max(0LL, j - m), j) + a[j] * (i + 1);
}
}
rep(j, n) seg.update(j, dp[j]);
}
cout << seg.get(0, n) << endl;
}
Submission Info
Submission Time |
|
Task |
A - Struck Out |
User |
roto_37 |
Language |
C++14 (GCC 5.4.1) |
Score |
500 |
Code Size |
4862 Byte |
Status |
TLE |
Exec Time |
2104 ms |
Memory |
3840 KB |
Judge Result
Set Name |
Sample |
subtask1 |
subtask2 |
subtask3 |
All |
Score / Max Score |
0 / 0 |
0 / 100 |
200 / 200 |
300 / 300 |
0 / 100 |
Status |
|
|
|
|
|
Set Name |
Test Cases |
Sample |
sample_1.txt, sample_2.txt, sample_3.txt |
subtask1 |
sample_2.txt, subtask_1_1.txt, subtask_1_2.txt, subtask_1_3.txt, subtask_1_4.txt, subtask_1_5.txt, subtask_1_6.txt, subtask_1_7.txt, subtask_1_8.txt, subtask_1_9.txt |
subtask2 |
sample_1.txt, sample_2.txt, sample_3.txt, subtask_2_1.txt, subtask_2_2.txt, subtask_2_3.txt, subtask_2_4.txt, subtask_2_5.txt, subtask_2_6.txt, subtask_2_7.txt, subtask_2_8.txt, subtask_2_9.txt |
subtask3 |
sample_1.txt, sample_2.txt, sample_3.txt, subtask_2_1.txt, subtask_2_2.txt, subtask_2_3.txt, subtask_2_4.txt, subtask_2_5.txt, subtask_2_6.txt, subtask_2_7.txt, subtask_2_8.txt, subtask_2_9.txt, subtask_3_1.txt, subtask_3_2.txt, subtask_3_3.txt, subtask_3_4.txt, subtask_3_5.txt, subtask_3_6.txt, subtask_3_7.txt, subtask_3_8.txt, subtask_3_9.txt |
All |
sample_1.txt, sample_2.txt, sample_3.txt, sample_1.txt, sample_2.txt, sample_3.txt, subtask_1_1.txt, subtask_1_2.txt, subtask_1_3.txt, subtask_1_4.txt, subtask_1_5.txt, subtask_1_6.txt, subtask_1_7.txt, subtask_1_8.txt, subtask_1_9.txt, subtask_2_1.txt, subtask_2_2.txt, subtask_2_3.txt, subtask_2_4.txt, subtask_2_5.txt, subtask_2_6.txt, subtask_2_7.txt, subtask_2_8.txt, subtask_2_9.txt, subtask_3_1.txt, subtask_3_2.txt, subtask_3_3.txt, subtask_3_4.txt, subtask_3_5.txt, subtask_3_6.txt, subtask_3_7.txt, subtask_3_8.txt, subtask_3_9.txt, subtask_4_1.txt, subtask_4_10.txt, subtask_4_11.txt, subtask_4_12.txt, subtask_4_13.txt, subtask_4_2.txt, subtask_4_3.txt, subtask_4_4.txt, subtask_4_5.txt, subtask_4_6.txt, subtask_4_7.txt, subtask_4_8.txt, subtask_4_9.txt |
Case Name |
Status |
Exec Time |
Memory |
sample_1.txt |
AC |
1 ms |
256 KB |
sample_2.txt |
AC |
1 ms |
256 KB |
sample_3.txt |
AC |
1 ms |
256 KB |
subtask_1_1.txt |
AC |
1 ms |
256 KB |
subtask_1_2.txt |
AC |
308 ms |
640 KB |
subtask_1_3.txt |
TLE |
2103 ms |
3840 KB |
subtask_1_4.txt |
AC |
17 ms |
512 KB |
subtask_1_5.txt |
AC |
66 ms |
3840 KB |
subtask_1_6.txt |
AC |
3 ms |
256 KB |
subtask_1_7.txt |
AC |
1267 ms |
3840 KB |
subtask_1_8.txt |
TLE |
2103 ms |
3840 KB |
subtask_1_9.txt |
AC |
9 ms |
256 KB |
subtask_2_1.txt |
AC |
2 ms |
256 KB |
subtask_2_2.txt |
AC |
1 ms |
256 KB |
subtask_2_3.txt |
AC |
2 ms |
256 KB |
subtask_2_4.txt |
AC |
1 ms |
256 KB |
subtask_2_5.txt |
AC |
1 ms |
256 KB |
subtask_2_6.txt |
AC |
1 ms |
256 KB |
subtask_2_7.txt |
AC |
2 ms |
256 KB |
subtask_2_8.txt |
AC |
2 ms |
256 KB |
subtask_2_9.txt |
AC |
2 ms |
256 KB |
subtask_3_1.txt |
AC |
488 ms |
3840 KB |
subtask_3_2.txt |
AC |
610 ms |
3840 KB |
subtask_3_3.txt |
AC |
592 ms |
3840 KB |
subtask_3_4.txt |
AC |
494 ms |
3584 KB |
subtask_3_5.txt |
AC |
16 ms |
512 KB |
subtask_3_6.txt |
AC |
273 ms |
3840 KB |
subtask_3_7.txt |
AC |
411 ms |
3840 KB |
subtask_3_8.txt |
AC |
50 ms |
640 KB |
subtask_3_9.txt |
AC |
543 ms |
3840 KB |
subtask_4_1.txt |
TLE |
2103 ms |
3840 KB |
subtask_4_10.txt |
TLE |
2103 ms |
3840 KB |
subtask_4_11.txt |
TLE |
2103 ms |
3840 KB |
subtask_4_12.txt |
TLE |
2103 ms |
3840 KB |
subtask_4_13.txt |
TLE |
2103 ms |
3840 KB |
subtask_4_2.txt |
TLE |
2103 ms |
3840 KB |
subtask_4_3.txt |
TLE |
2103 ms |
3840 KB |
subtask_4_4.txt |
TLE |
2103 ms |
3840 KB |
subtask_4_5.txt |
TLE |
2103 ms |
3840 KB |
subtask_4_6.txt |
AC |
295 ms |
3840 KB |
subtask_4_7.txt |
TLE |
2103 ms |
3840 KB |
subtask_4_8.txt |
TLE |
2104 ms |
3840 KB |
subtask_4_9.txt |
TLE |
2103 ms |
3840 KB |