제출 #40503

#제출 시각아이디문제언어결과실행 시간메모리
40503mohammad_kilani수열 (APIO14_sequence)C++14
0 / 100
40 ms24300 KiB
#include <bits/stdc++.h> using namespace std; #define mod 1000000007 #define oo 1000000000 const double PI = acos(-1); const int N = 10010 , K = 201; int arr[N] , n , k , a , b , low , high , best[N][K]; long long dp[N][K] , sum[N] , cur1 , cur2 ; int main(){ scanf("%d%d",&n,&k); for(int i=0;i<n;i++){ scanf("%d",&arr[i]); sum[i+1] = sum[i] + arr[i]; } for(int i=0;i<k;i++){ dp[n-1][i] = -1e17; best[n-1][i] = n - 1; } best[n-1][k] = n - 1; for(int i=n-2;i>=0;i--){ for(int j=0;j<k;j++){ a = i + 1; dp[i][j] = dp[a][j+1] + (sum[a] - sum[i]) * (sum[n] - sum[a]); best[i][j] = a; a = best[i+1][j]; while(a > i){ cur1 = dp[a][j+1] + (sum[a] - sum[i]) * (sum[n] - sum[a]); if(cur1 >= dp[i][j]){ dp[i][j] = cur1; best[i][j] = a; } else break; a--; } } } printf("%lld\n",dp[0][0]); int idx = 0; for(int i=0;i<k;i++){ if(i > 0) putchar(' '); printf("%d",best[idx][i]); idx = best[idx][i]; } puts(""); return 0; }

컴파일 시 표준 에러 (stderr) 메시지

sequence.cpp: In function 'int main()':
sequence.cpp:11:21: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d",&n,&k);
                     ^
sequence.cpp:13:22: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&arr[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...