Untitled
unknown
plain_text
a year ago
1.1 kB
6
Indexable
#include <bits/stdc++.h>
using namespace std ;
#define For(n) for(long long i = 0; i < n; i++)
#define endl '\n'
#define int long long
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int to_int(string s){//2736548
int x = 0;
For(s.length()){
int dig = s[i] - '0';
x*=10;
x+= dig;
}
return x;
}
void solve(){
int n,k;cin>>n>>k;
int arr[n];
For(n)cin>>arr[i];
int mx = arr[0] , currsum = arr[0];
for(int i =1; i < n; i++){
currsum =max(arr[i],currsum+arr[i]) ;
mx = max(mx,currsum);
}
int arrsum = 0;
For(n)arrsum += arr[i];
int mod = (10e9 +7);
if(mx <0)mx =0;
int sum = 0 ,x =1;
while(k-- &&mx){
sum += mx*x ;
sum %= mod;
cout << sum<<' '<<((mx%mod)*(x%mod))%mod <<endl;
x*=2;
}
sum += arrsum;
if(sum < 0) sum += mod;
cout << sum%mod;
}
signed main ()
{
fast
int t =1;
cin>>t;
while (t--){
solve();
cout << endl;
}
}Editor is loading...
Leave a Comment